#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long 
#define vint vector<ll>
#define pint pair<ll,ll>
#define vpint vector<pint>
#define ppint pair<pint,ll>
#define pb push_back
#define all(v) v.begin(),v.end()
#define ios cin.sync_with_stdio(false),cin.tie(NULL)
#define f_(i,m,n) for(ll i=m;i<n;i++)
#define ff first
#define ss second
const int MOD = 1e9 + 7;
/*const int N = 300500;
const int mod = 1000000007;
ll fact[N];
ll invFact[N];

ll fast_pow(ll a, ll p) {
    ll res = 1;
    while (p) {
        if (p % 2 == 0) {
            a = (a * a) % mod;
            p /= 2;
        } else {
            res = (res * a) % mod;
            p--;
        }
    }
    return res;
}

ll nck(ll n, ll k) {
    if (k > n) {
        return 0;
    }
    return fact[n] * invFact[k] % mod * invFact[n - k] % mod;
}
*/



void solve(){
    
    ll n;
    cin>>n;

    while(n%2 == 0){
        n/= 2;
    }

    if(n!= 1){
        cout<<"YES"<<endl;
        return;
    }
    cout<<"NO"<<endl;
    return;
}


int main(){
    ios;
    
    ll t;
    //t=1;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}


