1475A - Odd Divisor.cpp

/*
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
inputCopy
6
2
3
4
5
998244353
1099511627776
outputCopy
NO
YES
NO
YES
YES
NO
*/




#include<bits/stdc++.h>
using namespace std;
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
   
	int t;
	cin >> t;
	
	while (t--) {
		long long n;
		cin >> n;
		
		while (n % 2 == 0) n /= 2;
		
		n != 1 ? cout << "YES\n" : cout << "NO\n";
	}
   
    return 0;
}