Your friend Lucky is a little elf. Recently, Lucky discovered a magical creature, she named them ``Twinkle''. Lucky has a magical chain of vertices and edges, where the vertices are connected by the edges one by one. We assume that the vertices are numbered to from left to right, and the -th edge connects vertex and vertex . She found that Twinkles could live in the magical chain.

Lucky can put some Twinkles on some vertices simultaneously with her magic, but there should be at most one Twinkle in one vertex since the near Twinkles will perish together. Then, every second, each Twinkle will split into two Twinkles simultaneously and they will dash in the opposite directions to the two adjacent vertices.

Formally, a Twinkle in vertex splits into two Twinkles, the left splited Twinkle and the right splited Twinkle.

• The left splited Twinkle will dash toward the left and reach the vertex .

• The right splited Twinkle will dash toward the right and reach the vertex .

But unluckily, if one side has no vertex, the Twinkle will dash out of the chain and die out(for the left splited Twinkle in vertex and the right splited Twinkle in vertex ). Much more unfortunately, if two Twinkles dash to have a head-on collision (i.e. meet in the same vertex or edge), they will perish together with a tearing crash! Specifically, a crash will happen in two situations:

1.  The right splited Twinkle in vertex and the left splited Twinkle in vertex will crash in vertex (assuming that vertex lives no Twinkle).
2.  The right splited Twinkle in vertex and the left splited Twinkle in vertex will crash in the -th edge.

Lucky hopes there's always some Twinkle living on the chain. In addition, in order to be more convenient for Lucky to check the validity, there should be duplicated configurations within seconds. Specifically, a configuration can be denoted by a binary string of length , where iff vertex lives a Twinkle, and denotes the configuration after seconds. Your task is to find an initial configuration so that for each and that there exist two integers .

Input one line containing one integer , denoting the length of the chain.

If there is no solution, just output ``Unlucky''(without quotes) in one line.

Otherwise, output one line containing one binary string, denoting the initial configuration you found.

2

10

For the first case, the configurations will change like this:

, where  holds.

4

1000

For the second case, the configurations will change like this:

, where  holds.