There are many lamps in a line. All of them are off at first. A series of operations are carried out on these lamps. On the $i$-th operation, the lamps whose numbers are the multiple of $i$ change the condition ( on to off and off to on ). You should output whether the $n$-th light is on or off after infinity operations.

**Multiple test cases, please process to the End Of File.** Each test case occupies one line, contains a single integer $n\ (1\le n\le 10^5)$.

For each test case, output a integer, represents the confition of the $n$-th lamp after infinity operations (`0` - off, `1` - on).

Consider the second test case: The initial condition : 0 0 0 0 0 ...\ After the first operation : 1 1 1 1 1 ...\ After the second operation : 1 0 1 0 1 ...\ After the third operation : 1 0 0 0 1 ...\ After the fourth operation : 1 0 0 1 1 ...\ After the fifth operation : 1 0 0 1 0 ... The later operations cannot change the condition of the fifth lamp any more. So the answer is $0$.

校庆杯Warm Up