
Time Limit: 2 sec / Memory Limit: 1024 MB
Score : 300300 points
Problem Statement
We define sequences S_nSn as follows.
-
S_1S1 is a sequence of length 11 containing a single 11.
-
S_nSn (nn is an integer greater than or equal to 22) is a sequence obtained by concatenating S_{n-1}Sn−1, nn, S_{n-1}Sn−1 in this order.
For example, S_2S2 and S_3S3 is defined as follows.
-
S_2S2 is a concatenation of S_1S1, 22, and S_1S1, in this order, so it is 1,2,11,2,1.
-
S_3S3 is a concatenation of S_2S2, 33, and S_2S2, in this order, so it is 1,2,1,3,1,2,11,2,1,3,1,2,1.
Given NN, print the entire sequence S_NSN.
Constraints
-
NN is an integer.
-
1 \leq N \leq 161≤N≤16
Input
Input is given from Standard Input in the following format:
NN
Output
Print S_NSN, with spaces in between.