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

int main(){
    int T;
    cin >> T;
    //vが平方数であるか
    auto f = [&](ll v){
        if(v == 1)return true;
        ll ng = 1, ok = 1000000000, mid;
        while(ng + 1 < ok){
            mid = (ng + ok) / 2;
            if(mid * mid >= v)ok = mid;
            else ng = mid;
        }
        return (ok * ok == v);
    };
    while(T--){
        int n;
        cin >> n;
        vector<ll> a(n);
        for(auto &&v:a)cin >> v;
        sort(a.begin(), a.end());
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                if(i == j)continue;
                ll g = __gcd(a[i], a[j]);
                a[i] /= g, a[j] /= g;
            }
        }
        bool ans = true;
        for(int i = 0; i < n; i++){
            if(!f(a[i])){
                ans = false;
                break;
            }
        }
        cout << (ans ? "Yes" : "No") << '\n';
    }
}