#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
int n;
int a[MAXN];
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
void solve() {
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
a[2] = a[2] / gcd(a[1], a[2]);
for (int i = 3; i <= n; i++) {
a[2] = a[2] / gcd(a[2], a[i]);
}
if (a[2] == 1) {
printf("Yes\n");
} else {
printf("No\n");
}
}
int main() {
int t ;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
solve();
}
return 0;
}
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系:hwhale#tublm.com(使用前将#替换为@)