### Problem C: Persistent Numbers

| **1** | **2** | **3** | **4** | **5** | **6** | **7** | **8** | **9** |

**1** | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |

**2 ** | 2 | 4 | 6 | 8 | 10 | 12 | 14 | 16 | 18 |

**3 ** | 3 | 6 | 9 | 12 | 15 | 18 | 21 | 24 | 27 |

**4 ** | 4 | 8 | 12 | 16 | 20 | 24 | 28 | 32 | 36 |

**5 ** | 5 | 10 | 15 | 20 | 25 | 30 | 35 | 40 | 45 |

**6 ** | 6 | 12 | 18 | 24 | 30 | 36 | 42 | 48 | 54 |

**7 ** | 7 | 14 | 21 | 28 | 35 | 42 | 49 | 56 | 63 |

**8 ** | 8 | 16 | 24 | 32 | 40 | 48 | 56 | 64 | 72 |

**9 ** | 9 | 18 | 27 | 36 | 45 | 54 | 63 | 72 | 81 |

The multiplicative persistence of a number is defined by Neil Sloane
(Neil J.A. Sloane in * The Persistence of a Number * published
in Journal of Recreational Mathematics 6, 1973, pp. 97-98., 1973) as
the number of steps to reach a one-digit number when repeatedly
multiplying the digits. Example:
**679** -> **378** -> **168** -> **48** -> **32** -> **6**.

That is, the persistence of 679 is 5. The persistence of a single
digit number is 0.
At the time of this writing it is known that there are numbers with
the persistence of 11. It is not known whether there are numbers
with the persistence of 12 but it is known that if they exists then the
smallest of them would have more than 3000 digits.
The problem that you are to solve here is: what is the smallest number
such that the first step of computing its persistence results in the
given number?

For each test case there is a single line of input containing a decimal
number with up to 1000 digits. A line containing -1 follows the
last test case.
For each test case you are to output one line containing one integer
number satisfying the condition stated above or a statement saying that
there is no such number in the format shown below.

### Sample input

0
1
4
7
18
49
51
768
-1

### Output for sample input

10
11
14
17
29
77
There is no such number.
2688

*P. Rudnicki*

Waterloo Local - July 5, 2003.