#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define bits(x) __builtin_popcount(x)
#define present(c, x) ((c).find(x) != (c).end())
#define mem(x) memset(x,0,sizeof(x))
#define PI 3.1415926535897932384626

// bool sortbysec(const pair<ll,vector<ll>> &a,const pair<ll,vector<ll>> &b)
// {
//     return (a.second.size() > b.second.size());
// }

void solve() 
{
  ll n;
  cin>>n;
  ll temp;
  if(n%2==0)
  {
      temp=n/2;
      ll p=sqrt(temp);
      if(p*p==temp)
      {
        //   cout<<p<<endl;
          cout<<"YES"<<endl;
          return;
      }  
  }
  if(n%4==0)
  {
      temp=n/4;
      ll p=sqrt(temp);
      if(p*p==temp)
      {
        //   cout<<p<<endl;
          cout<<"YES"<<endl;
          return;
      } 
  }
  cout<<"NO"<<endl;
  
}

int main() 
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int t = 1;
    cin >> t;
    while(t--) {
      solve();
    }

    return 0;
}