#include<bits/stdc++.h>
#define fore(i,s,e) for (int i = s; i <= e; i++)
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define ll long long
#define INF 1000000000
#define endl "\n"
//const double PI = 3.141592653589793238460;
typedef std::complex<double> Complex;
typedef std::valarray<Complex> CArray;
using namespace std;
void add_self(ll &a,ll b)
{
    a+=b;
    if(a>mod) a-=mod;
}
int powb(int x, int y){
    int res=1;
    x=x%mod;
    while(y>0){
        if(y%2) res=(res*x)%mod;
        y/=2;
        x=(x*x)%mod;
    }
    return res;
}
int gcd(int a,int b)
{
    if(b==0) return a;
    return gcd(b,a%b);
}
template <typename T>
void i_vector(vector<T>&a)
{
    for(int i=0;i<a.size();i++)
      cin>>a[i];
}
bool sqr(int a)
{
    int ans=sqrt(a);
    ans*=ans;
    if(ans==a) return true;
    return false;
}
void solve()
{
    ll n;
    cin>>n;
    if(n%2 || (!sqr(n/2) && !sqr(n)))
    {
        cout<<"NO\n";
        return;
    }
    cout<<"YES\n";
}
int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.precision(10);cout << fixed;
    int t=0;
    cin>>t;
    while(t--)
        solve();
}