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

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(int)(n);i++)
#define rep1(i,n) for(ll i=1;i<(int)(n);i++)
#define replr(i,l,r) for(ll i=l;i<(int)(r);i++)
#define pl pair<ll,ll>
#define vi vector<int>
#define vii vector<vi>
#define vl vector<ll>
#define vll vector<vl>
#define All(c) (c).begin(), (c).end()
#define Print(x) cout<<(x)<<endl
#define Prints(x) cout<<setprecision(10)<<(x)<<endl
#define Printl(A,n) rep(i,n) {cout<<A[i]<<' ';} cout<<endl;
#define Printll(A,h,w) rep(i,h) {rep(j,w) {cout<<A[i][j]<<' '; } cout<<endl; } cout<<endl;
#define YesNo(Bool) Bool ? Print("Yes") : Print("No")

const ll INF = 1LL << 60;
double PI = 3.14159265358979323846;
ll MOD = 1000000007;
ll mod = 998244353;
vi sorted(vi A) {sort(All(A)); return A;}
//using mint = modint998244353;


/*
bool isSquare(ll x) {
    ll l=0;
    ll r=pow(10,10);
    ll m=(l+r)/2;

    while (r-l>1) {
        if (m*m==x) return true;
        else if (m*m>x) r=m;
        else l=m;
        m=(l+r)/2;
    return false;
    }
}
*/

ll gcd(ll x, ll y) {
	if (y == 0) return x;
	else return gcd(y, x % y);
}


bool isSquare(ll x) {
    ll a=(ll)sqrt(x);
    if (a*a == x) return true;
    else return false;
}




int main() {
    int T; cin>>T;
    rep(t,T) {
        int N; cin>>N;
        vl A(N); rep(i,N) cin>>A[i];

        rep(i,N) {
            rep(j,N) {
                if (i==j) continue;
                ll G = gcd(A[i], A[j]);
                A[i] /= G;
                A[j] /= G;
            }
        }

        bool flag = true;
        rep(i,N) {
            flag = flag && isSquare(A[i]);
        }

        YesNo(flag);




    }


}