### Parity check

Time Limit: 2000 ms Memory Limit: 524288 KiB

#### Problem Description

Fascinated with the computer games, Gabriel even forgets to study. Now she needs to finish her homework, and there is an easy problem:

f(n)=

She is required to calculate f(n) mod 2 for each given n. Can you help her?

#### Input

Multiple test cases. Each test case is an integer n(0≤n) in a single line.

#### Output

For each test case, output the answer of f(n)mod2.

#### Sample Input

2


#### Sample Output

1


#### Source

“浪潮杯”山东省第八届ACM大学生程序设计竞赛（感谢青岛科技大学）