/*

*/
#include<iostream>
#include<set> 
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
#include <unordered_set>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<ll,ll> P;
typedef pair<int,P> PP;
const ll MOD=998244353;

ll gcd(ll x,ll y){
    return y==0?x:gcd(y,x%y);
}

void solve(){
    ll N;
    cin>>N;
    vector<ll> A(N);
    for(int i=0;i<N;i++)cin>>A[i];

    for(int i=0;i<N;i++){
        for(int j=i+1;j<N;j++){
            ll g=gcd(A[i],A[j]);
            A[i]/=g;
            A[j]/=g;
        }
    }

    bool flag=true;

    for(int i=0;i<N;i++){
        //cout<<"A["<<i<<"]="<<A[i]<<endl;
        ll c=round(sqrt(A[i]));
        if(A[i]!=c*c) flag=false;
    }

    cout<<(flag?"Yes":"No")<<endl;


}

int main(){
    int T;
    cin>>T;

    for(int t=0;t<T;t++){
        solve();
    }

}