#include #include using namespace atcoder; using namespace std; using ll=long long; using ld=double; ld pie=3.14159265359; ll mod=998244353; long long inf=100000000000000001; ll gcd(ll a, ll b) { a = abs(a); b = abs(b); if (a < b)swap(a, b); while (b) { ll r=a%b; a=b; b=r; } return a; } int main(){ ll t; cin >> t; for (ll o = 0; o < t; o++) { ll n; cin >> n; vectora(n); for (ll i = 0; i < n; i++) { cin >> a[i]; } for (ll i = 0; i < n; i++) { for (ll j = i+1; j < n; j++) { ll x=gcd(a[i],a[j]); a[i]/=x; a[j]/=x; } } bool ok=true; for (ll i = 0; i < n; i++) { ll left=0,right=a[i]+1; while (right-left>1) { ll mid=(right+left)/2; ll y=0; if (a[i]%mid>=1) { y=1; } if (mid>a[i]/mid+y) { right=mid; }else{ left=mid; } } if (left*left!=a[i]) { ok=false; } } if (ok) { cout << "Yes" << endl; }else{ cout << "No" << endl; } } }