#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> a(n);
for (int &x : a) cin >> x;
int res = 1;
// Try all pairs and compute GCD
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
int g = __gcd(a[i], a[j]);
// Count frequencies of numbers modulo gcd
unordered_map<int, int> freq;
for (int x : a) freq[x % g]++;
// Find maximum frequency of same remainders
for (auto p : freq) {
if (p.second > 1) {
res = max(res, g);
}
}
}
}
cout << res << endl;
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwogICAgY2luLnRpZShOVUxMKTsKICAgIAogICAgaW50IHQ7CiAgICBjaW4gPj4gdDsKICAgIAogICAgd2hpbGUgKHQtLSkgewogICAgICAgIGludCBuOwogICAgICAgIGNpbiA+PiBuOwogICAgICAgIHZlY3RvcjxpbnQ+IGEobik7CiAgICAgICAgZm9yIChpbnQgJnggOiBhKSBjaW4gPj4geDsKCiAgICAgICAgaW50IHJlcyA9IDE7CiAgICAgICAgCiAgICAgICAgLy8gVHJ5IGFsbCBwYWlycyBhbmQgY29tcHV0ZSBHQ0QKICAgICAgICBmb3IgKGludCBpID0gMDsgaSA8IG47ICsraSkgewogICAgICAgICAgICBmb3IgKGludCBqID0gaSArIDE7IGogPCBuOyArK2opIHsKICAgICAgICAgICAgICAgIGludCBnID0gX19nY2QoYVtpXSwgYVtqXSk7CiAgICAgICAgICAgICAgICAKICAgICAgICAgICAgICAgIC8vIENvdW50IGZyZXF1ZW5jaWVzIG9mIG51bWJlcnMgbW9kdWxvIGdjZAogICAgICAgICAgICAgICAgdW5vcmRlcmVkX21hcDxpbnQsIGludD4gZnJlcTsKICAgICAgICAgICAgICAgIGZvciAoaW50IHggOiBhKSBmcmVxW3ggJSBnXSsrOwogICAgICAgICAgICAgICAgCiAgICAgICAgICAgICAgICAvLyBGaW5kIG1heGltdW0gZnJlcXVlbmN5IG9mIHNhbWUgcmVtYWluZGVycwogICAgICAgICAgICAgICAgZm9yIChhdXRvIHAgOiBmcmVxKSB7CiAgICAgICAgICAgICAgICAgICAgaWYgKHAuc2Vjb25kID4gMSkgewogICAgICAgICAgICAgICAgICAgICAgICByZXMgPSBtYXgocmVzLCBnKTsKICAgICAgICAgICAgICAgICAgICB9CiAgICAgICAgICAgICAgICB9CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICAgICAgCiAgICAgICAgY291dCA8PCByZXMgPDwgZW5kbDsKICAgIH0KICAgIAogICAgcmV0dXJuIDA7Cn0K