#include using namespace std; #include 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; using PP = pair; using Graph = vector>; using mint = modint998244353; #ifdef LOCAL #include #define debug(...) debug::multi_print(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (static_cast(0)) #endif int main(){ cin.tie(0); ios::sync_with_stdio(false); int quary; cin >> quary; rep(_,quary){ ll n; cin >> n; vector a(n); rep(i,n) cin >> a[i]; rep(i,n){ repn(j,i+1,n-1){ ll gcd = __gcd(a[i],a[j]); if(gcd != 1){ a[i] /= gcd; a[j] /= gcd; } } } bool ok = true; rep(i,n){ int s = sqrt(a[i]); if(s*s != a[i]){ ok = false; break; } } cout << (ok ? "Yes" : "No") << "\n"; } return 0; }