Odd Divisor

Description:

Input:

The first line contains one integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases. Then $$$t$$$ test cases follow.

Each test case contains one integer $$$n$$$ ($$$2 \le n \le 10^{14}$$$).

Please note, that the input for some test cases won't fit into $$$32$$$-bit integer type, so you should use at least $$$64$$$-bit integer type in your programming language.

Output:

For each test case, output on a separate line:

• "YES" if $$$n$$$ has an odd divisor, greater than one;
• "NO" otherwise.

You can output "YES" and "NO" in any case (for example, the strings yEs, yes, Yes and YES will be recognized as positive).

Sample Input:

6
2
3
4
5
998244353
1099511627776

Sample Output:

NO
YES
NO
YES
YES
NO