Your task is to find the minimal positive integer number Q so that the product of digits of Q is exactly equal to N.

The input contains the single integer number N (0 ≤ N ≤ 10⁹).

Your program should print to the output the only number Q. If such a number does not exist print −1.