#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n+1); i++)
#define repn(i,a,b) for (int i = (int)(a) ; i < (int)(b+1); i++)
#define repv(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) ((int)(x).size())
#define cauto const auto&
#define bit(n) (1LL<<(n))
#define uni(v) v.erase( unique(v.begin(), v.end()), v.end() );
using ll = long long;
using P = pair<ll,ll>;
using PP = pair<int, P>;
using Graph = vector<vector<int>>;
using mint = modint998244353;
#ifdef LOCAL
    #include <debug.hpp>
    #define debug(...) debug::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
    #define debug(...) (static_cast<void>(0))
#endif

vector<P> prime_factorization(ll n) {
    vector<P> res;
    for(ll p = 2; p * p <= n; p++){
        if(n % p != 0){
            continue;
        }
        ll e=0;
        while (n % p == 0){
            e++;
            n /= p;
        }
        res.push_back({p,e});
    }
    if (n != 1) {
        res.push_back({n,1});
    }
    return res;
}

int main(){
    int quary;
    cin >> quary;
    rep(_,quary){
        unordered_map<ll, ll> prime_cnt;
        ll n;
        cin >> n;
        vector<ll> a(n);
        rep(i,n) cin >> a[i];
        rep(i,n){
            auto pf = prime_factorization(a[i]);
            for(auto p:pf){
                prime_cnt[p.first] += p.second;
            }
        }
        bool ok = true;
        for(auto p:prime_cnt){
            if(p.second % 2 != 0){
                ok = false;
                break;
            }
        }
        cout << (ok ? "Yes" : "No") << endl;
    }
    return 0;
}