Codeforces Odd Divisor pt2

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define p_b pop_back
#define si stack<int>
#define sll stack<ll>
#define sc stack<char>
#define vi vector<int>
#define vll vector<ll>
#define mii map<int, int>
#define msi map<string, int>
#define mci map<char, int>
#define qc queue<char>
#define qi queue<int>
#define qll queue<ll>
using namespace std;

int ln2(int64_t n){
    while(n > 1){
        if(n%2 == 0){
            n /= 2;
        } else{
            return -1;
        }
    }
    return 1;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin >> t;
    while(t--){
        int64_t n;
        cin >> n;
        if(ln2(n) == 1){
            cout << "NO\n";
        } else{
            cout << "YES\n";
        }
    }
    return 0;
}