CODCHESS  Naya Shatranj (New Chess)
A and B are playing a very interesting variant of the ancient Indian game 'shatranj(also known as chess)' on a 'maidaan'(chessboard) n×n in size.
They take turns to put game pieces called 'ghoda'(knight) so that no two 'ghodas'(knights) could threat each other.
A 'ghoda' located in square (a,b) can threat squares (a+1,b+2),(a1,b+2),(a+1,b2),(a1,b2),(a+2,b1),(a+2,b+1),(a2,b1),(a2,b+1).
The player who can't put a new 'ghoda' during his move loses. Find out which player wins considering that both players play optimally well and A starts.
Input
The first line contains integer T (1≤T≤10^4) — the number of 'maidaans' (boards), for which you should determine the winning player. Next T lines contain T integers ni (1≤ni≤10^5) — the sizes of the 'maidaans'(chessboards).
Output
For each ni×ni board print on a single line "0" if A wins considering both players play optimally well. Otherwise, print "1".
Example
Input: 2
2
1 Output: 1
0
hide comments
aryan29:
20190601 00:09:57
Think of it mathematically without relying on pattern,question is good enough 

aryan29:
20190531 23:27:30
Good adhoc question Last edit: 20190601 00:10:29 

pandey101299:
20190321 05:40:36
my 50th 

pandey101299:
20190321 05:39:51
So easy


sonuverma:
20171018 16:28:47
Nothing to do in this problem. Just observe reasult for first 4 cases :D 

codiesam_007:
20170906 22:28:55
total wastage of time


anubhav1772:
20170717 16:01:24
Just need Observation..that's it 

vengatesh15:
20170119 12:05:12
Simple one.. 

aryanagal:
20160714 07:34:29
SO many WA for missing the \n, such an easy problem! Thanks @anuveshkothari 

dushyant_bgs:
20160627 19:24:00
Just observe the pattern. 
Added by:  CSI 
Date:  20130927 
Time limit:  0.186s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 