For Turbo C++ Users : Read the following document before attempting the question :

Problem description

Logan is tired of not being able to clear security clearances while travelling (thanks to his Adamantium skeleton :\ ). He goes to Magneto for some help regarding this matter. Magneto decides to help him, but only if Wolverine can answer his question correctly.

Given any number ‘n’, calculate the bitwise XOR of all whole numbers from 0 to 2^n-1 (including 0) , i.e. , [0,2^n).

Bitwise XOR
0^0 = 0, 1^1 = 0, 1^0 = 0^1 = 1
2 XOR 3:
2 ==     0 | 1 | 0
3 ==     0 | 1 | 1
2^3 == 0 | 0 | 1
To do "XOR" of 2 integer variables, most languages support '^' operator, i.e. , a = b ^ c ; will store b XOR c in a.
Logan isn’t so smart, so he comes to you for help.

Input

First line contains T, the number of test cases.
Each test case consists of a number N on a new line.

Output
For each test case, print the desired answer on a new line.

Constraints

1 ≤ T ≤ 10^5
0 ≤ N ≤ 10^7

Example
Input:
1
2

Output:
0

见题面

见题面