BestCoder Round #65 （ZYB's Game）

Accepts: 672

Submissions: 1207

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)

Problem Description

ZYBZYBZYB played a game named NumberBombNumber BombNumberBomb with his classmates in hiking:a host keeps a number in [1,N][1,N][1,N] in mind,then players guess a number in turns,the player who exactly guesses XXX loses,or the host will tell all the players that the number now is bigger or smaller than XXX.After that,the range players can guess will decrease.The range is [1,N][1,N][1,N] at first,each player should guess in the legal range.

Now if only two players are play the game,and both of two players know the XXX,if two persons all use the best strategy,and the first player guesses first.You are asked to find the number of XXX that the second player will win when XXX is in [1,N][1,N][1,N].

Input

In the first line there is the number of testcases TTT.

For each teatcase:

the first line there is one number NNN.

1≤T≤1000001 \leq T \leq 1000001≤T≤100000,1≤N≤100000001 \leq N \leq 100000001≤N≤10000000

Output

For each testcase,print the ans.

Sample Input

1
3

Sample Output

1
心得：总共才两个人，而且都知道X是多少（出题人在想什么？）先选的人先赢啊；

#include <iostream>
using namespace std;
int t,n;
int main(){
    cin>>t;
    for(int i=0;i<t;i++){
        cin>>n;
　　　　 cout<<n%2<<endl;
    }
    return 0;
}