Fascinated with the computer games, Gabriel even forgets to study. Now she needs to finish her homework, and there is an easy problem:
She is required to calculate f(n) mod 2 for each given n. Can you help her?
Multiple test cases. Each test case is an integer n(0≤n≤) in a single line.
For each test case, output the answer of f(n)mod2.