#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

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

struct Eratosthenes{
  vector<bool> isprime;
  vector<int> minfactor;
  vector<int> mobius;

  Eratosthenes(int N) : isprime(N+1,true),
                        minfactor(N+1,-1),
                        mobius(N+1,1){
    isprime[1]=false;
    minfactor[1]=1;

    for(int p=2;p<=N;++p){
      if(!isprime[p]) continue;

      minfactor[p]=p;
      mobius[p]=-1;

      for(int q=p*2;q<=N;q+=p){
        isprime[q]=false;

        if(minfactor[q]==-1) minfactor[q]=p;
        if((q/p)%p==0) mobius[q]=0;
        else mobius[q]=-mobius[q];
      }
    }
  }
                                                
  vector<pair<int,int>> factorize(int n){
    vector<pair<int,int>> res;
    while(n>1){
      int p=minfactor[n];
      int exp=0;

      while(minfactor[n]==p){
        n/=p;
        ++exp;
      }
      res.emplace_back(p, exp);
    }
    return res;
  }  

  vector<int> divisors(int n){
    vector<int> res({1});

    auto pf=factorize(n);

    for(auto p:pf){
      int s=(int)res.size();
      for(int i=0;i<s;++i){
        int v=1;
        for(int j=0;j<p.second;++j){
          v*=p.first;
          res.push_back(res[i]*v);
        }
      }
    }
    return res;
  }
};

//10^18 までの ΠA[i] が平方数かどうか
//素因数2が奇数個ならダメ
//残りの奇数で平方剰余であり得ないやつを落とす
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  Eratosthenes er(600);
  vector<int> B;
  for(int i=3;i<600;i++){
    if(er.isprime[i]) B.push_back(i);
  }
  int b=B.size();
  vector<set<int>> C(b);
  rep(i,b){
    int j=0;
    while(C[i].size()<(B[i]+1)/2){
      C[i].insert(j*j%B[i]);
      j++;
    }
  }

  int t;
  cin>>t;
  while(t--){
    int n;
    cin>>n;
    vector<ll> A(n);
    ll cnt=0;
    rep(i,n){
      cin>>A[i];
      while(A[i]%2==0){
        A[i]/=2;
        cnt++;
      }
    }
    if(cnt%2==1){
      cout<<"No"<<endl;
      continue;
    }
    
    bool f=true;
    rep(i,b){
      ll tmp=1;
      rep(j,n) tmp=tmp*(A[j]%B[i])%B[i];
      if(C[i].count(tmp)==0) f=false;
    }
    if(f) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
  }
  
  return 0;
}