#include #include #include #include #include #include #include #include #include #include #include #include #include #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template vector> vec2d(int n, int m, T v){ return vector>(n, vector(m, v)); } template vector>> vec3d(int n, int m, int k, T v){ return vector>>(n, vector>(m, vector(k, v))); } template void print_vector(vector v, char delimiter=' '){ if(v.empty()) { cout << endl; return; } for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter; cout << v.back() << endl; } /** * y*y <= xを満たす最大の非負整数yを返します */ long long floor_sqrt(long long x){ long long sq = sqrt(x)+0.1; if(sq*sq > x) sq--; return sq; } void solve(){ int n; cin >> n; vector a(n); for(int i = 0; i < n; i++) cin >> a[i]; for(int i = 0; i < n; i++){ while(a[i] > 1){ bool update = false; for(int j = i+1; j < n; j++){ ll g = gcd(a[i], a[j]); if(g == 1) continue; a[i] /= g; a[j] /= g; update = true; break; } if(!update){ ll x = floor_sqrt(a[i]); if(x*x == a[i]){ a[i] = 1; break; } cout << "No" << endl; return; } } } cout << "Yes" << endl; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; int t; cin >> t; while(t--) solve(); }