Red John Game

Time Limit: 2000ms, Special Time Limit:5000ms,Memory Limit:65536KBTotal submit users: 20, Accepted users:15Problem 12902 : No special judgementProblem description

Red John has a chess table of infinite dimensions, and n * n pawns, arranged in an n x n square. The pawns can be moved horizontally or vertically, buy jumping over an (horizontally or vertically) adjacent pawn, and onto the next position, only if this position is unoccupied by another pawn. Also, when a valid move occurs, the jumped pawn is removed. Can you help Red John figure out if there is a sequence of moves which leaves only one pawn on the table ?

Below, such a sequence of moves is illustrated, for n = 2. Pawns are depicted by the letter P.

Input

The program input is from a text file. Each file contains a value for n, with 0 < n < 10^9.

Output

The output consists of 1 if there is a sequence of moves leaving only one pawn on the table, and 0 otherwise. There cannot be any whitespace and newline characters in the output.

Sample Input

34

Sample Output

01

//详求原理，有点模糊，L形相消，因为%3为1则为一个点，为2则可化为2个点，则不被3整除即可//一堆规律题啊 //1+3*k=n*n,不能让她往外走，要让她往内走 #include<iostream>#include<cstring>#include<cstdio>using namespace std;int main(){__int64 n; while(scanf("%I64d",&n)!=EOF){if(n%3==0)cout<<'0'<<endl;elsecout<<'1'<<endl;}return 0;}