URI Online Judge | 1671
# Code

**Timelimit: 1**

Local Contest, University of Ulm Germany

KEY Inc., the leading company in security hardware, has developed a new kind of safe. To unlock it, you don't need a key but you are required to enter the correct *n*-digit code on a keypad (as if this were something new!). There are several models available, from toy safes for children (with a 2-digit code) to the military version (with a 6-digit code).

The safe will open as soon as the last digit of the correct code is entered. There is no "enter" key. When you enter more than *n* digits, only the last *n* digits are significant. For example (in the 4-digit version), if the correct code is 4567, and you plan to enter the digit sequence 1234567890, the door will open as soon as you press the 7 key.

The software to create this effect is rather simple. In the *n*-digit version the safe is always in one of *10 ^{n-1}* internal states. The current state of the safe simply represents the last

A trivial strategy to open the safe is to enter all possible codes one after the other. In the worst case, however, this will require *n * 10 ^{n}* keystrokes. By choosing a good digit sequence it is possible to open the safe in at most

The input contains several test cases. Every test case is specified by an integer * n*. You may assume that

For each test case specified by *n* output a line containing a sequence of *10 ^{n} + n - 1* digits that contains each

Sample Input | Sample Output |

1 |
0123456789 00102030405060708091121314151617181922324252627282933435363738394454647484955657585966768697787988990 |