A. Distractions
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

In previous meetings of the Independent Organization of Epizootics, also known as the World Organization for Animal Health, everyone gathered in Barcelona to discuss the most relevant topics. However, every year several problems occurred.

The attendees at the meeting never manage to concentrate; they get distracted by any trivial matter. In the last meeting, for example, they were entertained by a piece of paper on the wall with the following lines.

1

11

21  

1211  

111221  

312211  

They spent a long time trying to decipher this tough problem until someone explained the solution to them. Each line is simply generated by reading the previous line aloud. For example, the second line is "one one," the third is "two ones" (and not "eleven"), etc.  

To prevent this problem from happening again, the organization asks you to write a program that outputs the i-th number of the sequence, where $$$a_0 = 1$$$.

Input

The input consists of a single case.

The case contains only one integer $$$N$$$.

Output

The output consists of a single line, the value of the $$$N$$$-th term of the sequence.

Scoring

$$$ 1 \leq N \leq 53 $$$

There is one case for each value of $$$N$$$. Each case, except for the three examples, is worth 2 points.

Examples
Input
1
Output
11
Input
2
Output
21
Input
7
Output
1113213211