Our hero Ninja is organizing a coding competition where only two teams can participate simultaneously. To make the competition interesting and fair, both the teams should have an equal number of members. As an organizer, Ninja got the task of making the two teams.

There are some conditions for creating teams. For each competition, he will be given a number ‘N’, and for each divisor ‘D’ of ‘N’ ( including 1 and ‘N’ itself ), he will add a member:

1) to the first team if ‘D’ is even.

2) to the second team if ‘D’ is odd.

Since Ninja is very busy organizing the event, he wants you to help him with the task. Your task is to tell Ninja if he can create two teams with an equal number of members.

For Example:

For ‘N’ = 10,
The divisors are:
1, 2, 5, 10.
The first team will have two members corresponding to divisors 2 and 10.
The second team will have two members corresponding to divisors 1 and 5.
So, in this case, Ninja can make two teams.

Input Format:

The first line contains an integer ‘T’ which denotes the number of test cases to run.

Then the test case follows:

The first and only line of each test case contains an integer ‘N’ denoting the number given to Ninja. 

Output Format:

For each test case print ‘true’ if Ninja can make two teams of equal members with the given ‘N’, else print ‘false’.

Output for each test case will be printed in a separate line.

Note:

You are not required to print anything, it has already been taken care of. Just implement the function.

Constraints:

1 <= T <= 100
1 <= N <= 10^5

It is guaranteed that the sum of N over all test cases doesn’t exceed 10^5.

Time Limit: 1 sec