Solve the programming task below in a Python markdown code block.
Given a number X between 0 to 1000000006 find smallest positive integer Y such that the products of digits of Y modulo 1000000007 is X.

Input Format

A single integer - X

Output Format

A single integer - Y

Input Constraint

0 ≤ X ≤ 1000000006

Problem Setter: Practo Tech Team

SAMPLE INPUT
16

SAMPLE OUTPUT
28

Explanation

If x is 16 then y is 28 as (2*8)%1000000007 = 16