Bacteria
시간 제한1초메모리 제한512 MB
주어진 n에 대해 길이가 2^n인 이진 문자열을 출력하는 문제로, 반씩 나누는 과정에서 만들어지는 서로 다른 DNA 문자열의 수가 최대가 되어야 한다.
문제
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 of even length ( denotes the -th character of the string and is equal to either or ). Then, after the division there are two bacteria with DNA equal to and , respectively.
For the experiment, the scientists are planning to take a bacterium with DNA of length . The experiment consists of 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 , in the second --- two bacteria with DNA of length each, and so on. Finally, at the -st step, there will be 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 () denoting that the DNA of first bacterium should have the length of .
출력
Print one string of characters and , its length must be equal to --- 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: , , , , , , , and .