#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long gcd(long long a, long long b) {
	if (b == 0) return a;
	else return gcd(b, a%b);
}
pair<bool, long long> is_squere(long long N) {
	long long r = (long long)floor(sqrt((long double)N));  // 切り捨てした平方根
	return { (r * r) == N ,r };
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n; cin >> n;
		vector<long long>a(n);
		rep(i, n)cin >> a[i];
		rep(i, n)rep2(j, i + 1, n) {
			long long g = gcd(a[i], a[j]);
			a[i] /= g;
			a[j] /= g;
		}
		bool chk = true;
		rep(i, n)if (!is_squere(a[i]).first)chk = false;
		if (chk)cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	return 0;
}