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_2…s_k of even length k (s_i denotes the i-th character of the string S and is equal to either 0 or 1). Then, after the division there are two bacteria with DNA equal to s_1s_2…s_2k and s_2k+1…s_k−1s_k, respectively.
For the experiment, the scientists are planning to take a bacterium with DNA of length 2n. The experiment consists of n+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 2n, in the second --- two bacteria with DNA of length 2n−1 each, and so on. Finally, at the n+1-st step, there will be 2n 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 n (1≤n≤20) denoting that the DNA of first bacterium should have the length of 2n.
Print one string of characters 0 and 1, its length must be equal to 2n --- 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: 00100111, 0010, 0111, 00, 10, 01, 11, 0 and 1.