Your task is to find the minimal positive integer number *Q* so that the product of digits of *Q* is exactly equal to *N*.

### Input

The input contains the single integer number *N* (0 ≤ *N* ≤ 10^{9}).

### Output

Your program should print to the output the only number *Q*. If such a number does not exist print −1.

### Sample

**Problem Source: **Ural State University Internal Contest '99 #2