#include <bits/stdc++.h>
using namespace std;
#define ll                  long long 
#define pb                  push_back
#define ppb                 pop_back
#define um                  unordered_map
#define MOD                 1000000007
#define CASE(idx,val)       cout<<"Case #"<<idx<<": "<<val<<endl;
#define rep(i,s,e)          for(int i=s; i<e; i++)
#define rrep(i,s,e)         for(int i=e-1; i>=s; i--)
#define all(x)              (x).begin(),(x).end()
#define uniq(v)             (v).erase(unique(all(v)),(v).end())
#define sz(x)               (int)((x).size())
#define ff                  first
#define ss                  second
#define mp                  make_pair
#define pii                 pair<int,int>
#define mem1(a)             memset(a,-1,sizeof(a))
#define mem0(a)             memset(a,0,sizeof(a))

map<int,bool> mymap;
void solve(){

    int mul = 1;
    for(int i=1; mul<=MOD; i++){
        mul = i*i*2;
        mymap[mul] = 1;
        mymap[mul*2] = 1;
    }
}

int main(){

    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    #ifndef ONLINE_JUDGE
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
    #endif

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

        bool f = mymap[n];
        if(f) cout<<"YES\n";
        else cout<<"NO\n";
    }

 return 0;           
}