A-新年快乐

You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x>1) that n is divisible by x and x is odd).

For example, if n=6, then there is x=3. If n=4, then such a number does not exist.

Input
The first line contains one integer t (1≤t≤104) — the number of test cases. Then t test cases follow.

Each test case contains one integer n (2≤n≤1014).

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).

Example
Input

6
2
3
4
5
998244353
1099511627776

Output

NO
YES
NO
YES
YES
NO

Answer

#include <stdio.h>
int main()
{
	long long t, n;
	scanf("%lld", &t);
	while(t --)
	{
		scanf("%lld", &n);
		while(n%2 == 0) n /= 2;//不断除2直到为奇数为止
		
		if(n == 1) 
			printf("NO\n");//若为1则该数没有除1以外的其它奇因数
		else
			printf("YES\n");//若不为1则n为该数的一个不为1的奇因数
    }
    return 0;
}