A. Odd Divisor | Logarithom

#include<bits/stdc++.h>
using namespace std;

#define int long long
#define pII pair<int,int>
#define mem(a,b) memset(a,b,sizeof(a))

#define do(i, a, b) for (int i=(a); i<(b); i++)
#define dor(i,a,b) for (int i = (b)-1; i >= (a); i--)

#define com(s) (s).begin(),(s).end()
#define F first
#define S second
#define pb push_back
#define CASES int tc;cin>>tc;while(tc--)
#define UNIQUE(X) (X).erase(unique(S(X)),(X).end())
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL);
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define endl '\n'

const int M = 1000000007;
const int MAXN = 10000001;
const int INF = 1e18;

//DEBUGGING-TOOL
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
    cerr <<*it << " = " << a << endl;
    err(++it, args...);
}

//CODE
int32_t main() {
    IOS
    CASES {
        int  n, l, r, c = 0;
        cin >> n;
      if(floor(log2(n)) == ceil(log2(n))) cout << "NO" << '\n';
      else cout << "YES" << '\n';
    }
}