eolymp
bolt
Try our new interface for solving problems
Problems

One-two

One-two

Time limit 1 second
Memory limit 256 MiB

Horse Valera has an integer n. Also, Horse Valera has hooves. It is difficult to write with hooves, so Valera can only write the numbers one ("1") and two ("2").

Now Valera wants to find a positive integer that will be divisible by 2^n without a remainder and will contain exactly n digits in decimal notation. Of course, the decimal representation of this number should not contain any digits other than ones and twos.

Help Valera, find and print the desired number.

Input data

The first line contains an integer n (1 ≤ n ≤ 50) — Valera's number.

Output data

Print a positive integer in decimal notation, consisting of n digits, which will be divisible by 2^n. The decimal representation of this number can only contain ones and twos.

It is guaranteed that the answer exists. If there are multiple answers, any one is allowed.

Examples

Input example #1
1
Output example #1
2
Source Winter School Kharkov 2013, Day 6 - G.Agapov and I.Fefer