#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<long long>
#define all(v) begin(v),end(v)
#define vs vector<string>
#define ll long long
#define vi vector<int>
#define all(v) begin(v),end(v)
#define vs vector<string>
#define qi queue<int>
#define pqi priority_queue<int>
#define sti stack<int>
#define si set<int>
#define mpi map<int,int>
#define mps map<string,int>
#define mpc map<char,int>
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define pi pair<int,int>
#define vpi vector<pair<int,int> >
#define np next_permutation
#define mod 1000000007
#define INF 100000000
const int mxn = 1e6 + 100;
vector<ll> primes;
bool vis[mxn];
void sieve() {
    for (int i = 2; i < mxn; i++) {
        if (vis[i]) continue;
        primes.push_back(i);
        for (int j = i+i; j < mxn; j += i) {
            vis[j]=1;

        }
    }
}
vector<vector<int>> adj;
void dfs(int u)
{
    cout<<u<<" ";
    vis[u]=1;
    for(int v: adj[u]){
        if(vis[v]) continue;
        dfs(v);
    }
}
int log2(int n)
{
    int ans=0;
    while(n>1){
        n/=2 ;
        ans++;
    }
    return ans;
}
int main(){

    int t;
    cin>>t;
    while(t--){

        ll n; cin>>n;
        while(n%2==0){
            n/=2;
        }
        if(n!=1) cout<<"YES"<<'\n';
        else cout<<"NO"<<'\n';
    }
    return 0;
}
