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

#ifdef _RUTHEN
#include <debug.hpp>
#else
#define show(...) true
#endif

using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> using V = vector<T>;

bool f(unsigned long long x) {
    unsigned long long ok = 0, ng = 1000'000'001ULL;
    while (ng - ok > 1) {
        unsigned long long a = (ng + ok) / 2;
        if (a * a <= x) {
            ok = a;
        } else {
            ng = a;
        }
    }
    return ok * ok == x;
}

void solve() {
    int N;
    cin >> N;
    V<ll> A(N);
    rep(i, N) cin >> A[i];
    bool ok = true;
    rep(j, N) {
        rep(i, j) {
            ll g = gcd(A[i], A[j]);
            A[i] /= g;
            A[j] /= g;
        }
    }
    rep(i, N) {
        if (!f(A[i])) {
            ok = false;
        }
    }
    cout << (ok ? "Yes" : "No") << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int tt;
    cin >> tt;
    while (tt--) solve();
    return 0;
}