Tom and Jerry
##### Submissions: 6265   Accuracy: 61.17%   Difficulty: Easy   Marks: 2

Since very long time Tom and Jerry have been fighting with each other for a piece of Cheese. So finally you came to rescue and decided that the result of the fight will be decided by a mathematical game , in which you will write a number N . Tom and Jerry will play the game alternatively and each of them would subtract a number n [n< N] such that N%n=0.
The game is repeated turn by turn until the one,who now cannot make a further move looses the game.
The game begins with Tom playing first move.It is well understood that both of them will make moves in optimal way.You are to determine who wins the game.

Input:
The first line of input contains a single integer T denoting the number of test cases.Then T test cases follow. The first line of each test case consists of N the number.

Output:
Print 1 if Tom wins and Print 0 if Jerry wins in a separate line.

Constraints:
1 <= T <= 100
1 <= N <= 106

Example:
Input:

4

Output:

1

#### ** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Siddharth Dungarwal
Author: sd5869

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.