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: #include <bits/stdc++.h> 

using namespace std; 

int main() 
{ 
	long long int n;
	cin>>n;
	if (n <= 9){
		cout<<n;
	}
	else{
	stack<int> res; 
	for (int i=9; i>=2 && n > 1; i--) 
	{ 
		while (n % i == 0) 
		{ 
			res.push(i); 
			n = n / i; 
		} 
	} 
	
	if (n != 1) 
		cout<<"-1";
	
	else{	
		
	string k = ""; 
	while (!res.empty()) 
	{ 
		k = k + to_string(res.top()); 
		res.pop(); 
	} 
	
		cout<<k;
	}

	}
	return 0; 
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?