For this Question: You are given an integer N. You need to create an integer A, such that the product of digits of A is equal to N and the value of A is minimum possible.  

Output -1 if no such answer exists.The first and the only line of input contains an integer N.

1 <= N <= 1000000000000000000 (10^18)Output a single integer A. 

(The answer may not fit into 64 bit integer)Sample Input
27

Sample Output
39

Explanation :
The possible values for product 27 are 39, 93, 333, 139, 1139... (39 is the minimum possible)

Sample Input 
26

Sample Output
-1, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) throws IOException{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		long n=Long.parseLong(br.readLine());

        int i, j=0;
        int MAX = 50;
        int[] res = new int[MAX];

        if (n < 10)
        {
            System.out.println(n+10);
            return;
        }
        for (i=9; i>1; i--)
        {
            while (n%i == 0)
            {
                n = n/i;
                res[j] = i;
                j++;
            }
        }
        if (n > 10)
        {
            System.out.println(-1);
            return;
        }
        for (i=j-1; i>=0; i--)
            System.out.print(res[i]);

	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?