Power of Two Problem Statement

Determine whether a given integer N is a power of two. Return true if it is, otherwise return false.

Explanation

An integer 'N' is considered a power of two if it can be expressed in the form 2^K where 'K' is an integer.

Input

The first line of input contains an integer ‘T’ representing the number of test cases. Then the test cases follow.

The only line of each test case contains an integer 'N'.

Output

For each test case, the only line of output prints whether the integer ‘N’ is a power of 2 or not.

The output for each test case is in a separate line.

Example

Input:

T = 3
2
3
16

Output:

true
false
true

Constraints:

• 1 <= T <= 100
• -2^31 <= N <= 2^31 - 1
• Time Limit: 1sec

Note:

You do not need to print anything; it has already been taken care of. Just implement the given function.