시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 512 MB 1 1 1 100.000%

문제

You are given an even integer $n$. Construct a binary number $a = \overline{a_1 a_2 \ldots a_n}$ consisting of $n$ binary digits such that it is divisible by $n$, and all numbers $\overline{a_1 a_2 \ldots a_i}$ (the prefixes of $a$ in binary notation) for $i = 1, 2, \ldots, n$ have different remainders modulo $n$.

입력

The only line of input contains an integer $n$ ($2 \le n \le 1000$, $n$ is even).

출력

Print the desired number $\overline{a_1 a_2 \ldots a_n}$ as a string of $n$ binary digits. Leading zeroes are disallowed. If there are several possible answers, print any one of them. It is guaranteed that at least one answer exists under these constraints.

예제 입력 1

2

예제 출력 1

10

예제 입력 2

4

예제 출력 2

1100