Parity check

Parity check

Time Limit: 2000MS Memory Limit: 524288KB

SubmitStatistic

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.

Example Input

2

Example Output

1

Hint

Author

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

n=0 0 1 2 3 4 56 7 8 9 1011 12 121     1221

f(n) 01 1 2 3 58  13 21 34 5589 144

输出结果 01 1 0 1 10 1 1 0 11 0 1 0

即以0，1，1三位数一次循环

import java.util.*;import java.math.*;public class Main {static String str;static char [] st = new char [10000];  public static void main(String[] args) {// TODO Auto-generated method stubScanner in = new Scanner (System.in);while(in.hasNext()){    str=in.next();    st=str.toCharArray();    int num=0;    for(int i=0;i<str.length();i++)    {    num=(num*10+(st[i]-'0'))%3;    }    if(num==0)    {    System.out.println(0);    }    else    {    System.out.println(1);    }}}}