Product of digits#1116
Given an integer . Write a program to find the minimal positive integer such that the product of its digits is exactly .
There are several tests. Each test consists of an integer (0 \leq n \leq 10^9) on a single line.
For each test print the corresponding number in a single line. If such does not exist, print -1.
Example 1