For a given non-negative integer number N , find the minimal Q such that the product of all digits of Q is equal N .
The first line of input contains one positive integer number, which is the number of data sets. Each subsequent line contains one data set which consists of one non-negative integer number N (0 <= N <= 109) .
For each data set, write one line containing the corresponding number Q or `-1' if Q does not exist. Note that Q >= 0.