#include <iostream>
#include <algorithm>
using namespace std;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
bool is_good(int a[], int n) {
int g = a[0];
for (int i = 1; i < n; i++) {
g = gcd(g, a[i]);
}
return g <= n;
}
bool is_beautiful(int a[], int n) {
for (int i = 2; i <= n; i++) {
if (!is_good(a, i)) {
return false;
}
}
return true;
}
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (is_beautiful(a, n)) {
cout << "Yes\n";
} else {
sort(a, a + n, greater<int>());
if (is_beautiful(a, n)) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IGdjZChpbnQgYSwgaW50IGIpIHsKICAgIGlmIChiID09IDApIHJldHVybiBhOwogICAgcmV0dXJuIGdjZChiLCBhICUgYik7Cn0KCmJvb2wgaXNfZ29vZChpbnQgYVtdLCBpbnQgbikgewogICAgaW50IGcgPSBhWzBdOwogICAgZm9yIChpbnQgaSA9IDE7IGkgPCBuOyBpKyspIHsKICAgICAgICBnID0gZ2NkKGcsIGFbaV0pOwogICAgfQogICAgcmV0dXJuIGcgPD0gbjsKfQoKYm9vbCBpc19iZWF1dGlmdWwoaW50IGFbXSwgaW50IG4pIHsKICAgIGZvciAoaW50IGkgPSAyOyBpIDw9IG47IGkrKykgewogICAgICAgIGlmICghaXNfZ29vZChhLCBpKSkgewogICAgICAgICAgICByZXR1cm4gZmFsc2U7CiAgICAgICAgfQogICAgfQogICAgcmV0dXJuIHRydWU7Cn0KCmludCBtYWluKCkgewogICAgaW50IHQ7CiAgICBjaW4gPj4gdDsKICAgIHdoaWxlICh0LS0pIHsKICAgICAgICBpbnQgbjsKICAgICAgICBjaW4gPj4gbjsKICAgICAgICBpbnQgYVtuXTsKICAgICAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewogICAgICAgICAgICBjaW4gPj4gYVtpXTsKICAgICAgICB9CiAgICAgICAgaWYgKGlzX2JlYXV0aWZ1bChhLCBuKSkgewogICAgICAgICAgICBjb3V0IDw8ICJZZXNcbiI7CiAgICAgICAgfSBlbHNlIHsKICAgICAgICAgICAgc29ydChhLCBhICsgbiwgZ3JlYXRlcjxpbnQ+KCkpOwogICAgICAgICAgICBpZiAoaXNfYmVhdXRpZnVsKGEsIG4pKSB7CiAgICAgICAgICAgICAgICBjb3V0IDw8ICJZZXNcbiI7CiAgICAgICAgICAgIH0gZWxzZSB7CiAgICAgICAgICAgICAgICBjb3V0IDw8ICJOb1xuIjsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgIH0KICAgIHJldHVybiAwOwp9Cg==