ZCMU 2009: Parity check

Description

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?

Input

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

Output

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

Sample Input

2

Sample Output

1

#include<stdio.h>
#include<string.h>
char a[2023];
int main()
{
	int i,l,b;
	while(~scanf("%s",&a)){
		l=strlen(a);
		b=0;
		for(i=0;i<l;i++){
			b=(b*10+a[i]-'0')%3;
		}
		if(b==1||b==2) printf("1\n");
		else printf("0\n");
	}
	return 0;
}