As a traveler, you once witnessed the war of Inazuma, of which sides are the resistance and the Shogun's army.

The map of Inazuma can be viewed as a unit -dimensional hypercube, which has exactly vertices. Each vertex is labeled with an integer from 0 to . Two vertices are adjacent if and only if there exists exactly one different bit in their -bit binary representation.

In the war of Inazuma, some vertices were occupied by the resistance army, and others were occupied by the Shogun's Army. You also noticed that for each vertex , the number of vertices adjacent to  and occupied by the same side as  was no more than .

Many years later, you have already forgotten details of the war. Can you construct a hypercube satisfying all the above requirements?

The only line contains a single integer .

Output a 01-string of length . The -th bit describes which side is vertex  occupied by, 0 for the resistance army and 1 for the Shogun's army. Here  is an -bit binary representation. Any answer satisfying all requirements will be accepted.

2

0111