Bacteria

아직 제출이 없습니다시간 제한1초메모리 제한512 MB

문제

The Berland University of Biology (BUB) studies bacteria. It is known that the behaviour of a bacterium is determined by the structure of its DNA. In this problem, we assume that the bacterial DNA is a string consisting of zeros and ones.

Recently, scientists at the BUB have discovered a new type of bacteria. Its main feature is that when a bacterium divides, its DNA does not double, but divides into two halves. More precisely, let's suppose that the DNA of the original bacterium is a string S=s_1s_2s_kS=s\_1s\_2\ldots s\_k of even length kk (s_is\_i denotes the ii-th character of the string SS and is equal to either 00 or 11). Then, after the division there are two bacteria with DNA equal to s_1s_2s_k2s\_1s\_2\ldots s\_{\frac{k}{2}} and s_k2+1s_k1s_ks\_{\frac{k}{2}+1}\ldots s\_{k-1}s\_k, respectively.

For the experiment, the scientists are planning to take a bacterium with DNA of length 2n2^n. The experiment consists of n+1n+1 steps. At the end of each of step, except for the last one, each currently available bacterium divides. So, in the first step, there will be only one bacterium with DNA of length 2n2^n, in the second --- two bacteria with DNA of length 2n12^{n-1} each, and so on. Finally, at the n+1n+1-st step, there will be 2n2^n bacteria, each of them will have only one character in its DNA.

Of course, it is not interesting to study bacteria with the same DNA. Determine what the DNA that the first bacterium should have, so that there are as many different types of DNA as possible obtained during the experiment.

입력

The first line contains one integer nn (1n201\le n\le 20) denoting that the DNA of first bacterium should have the length of 2n2^n.

출력

Print one string of characters 00 and 11, its length must be equal to 2n2^n --- the DNA of the first bacterium, so that the number of different DNA during the experiment is greatest possible. If there are many possible answers, print any of them.

힌트

There will be 9 different DNA to appear during the experiment in the first sample test: 0010011100100111, 00100010, 01110111, 0000, 1010, 0101, 1111, 00 and 11.