#include <bits/stdc++.h>
#ifdef LOCAL
#include "template.cpp.h"
#else
#define debug(...)
#endif
//#define int long long
using namespace std;
#define cinv(v) for (auto &it:v) cin>>it;
#define coutv(v) for (auto &it:v) cout<< it<<' '; cout<<'\n';
const int N = 101;
int lcm_[N][N];
void shelby() {
int n, cnt[N];
cin >> n;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
for (int j = 1; j * j <= x; ++j) {
if (x % j == 0) {
cnt[j]++;
if (j != x / j) cnt[x / j]++;
}
}
}
int ans = 0;
for (int i = 1; i < N; ++i) {
for (int j = i; j < N; ++j) {
if (i == j) {
if (cnt[i] == n) ans = max(ans, 2 * i);
continue;
}
int a = cnt[i], b = cnt[j], l = lcm_[i][j], c = (l < N ? cnt[l] : 0);
if (a < b) swap(a, b);
int extra = a - n / 2 - (n % 2);
c -= extra;
if (extra < 0 || c < 0) continue;
b -= c;
if (b == n / 2) ans = max(ans, i + j);
}
}
cout << ans << '\n';
for (int i = 1; i < N; ++i) cnt[i] = 0;
}
signed main() {
cin.tie(0)->ios_base::sync_with_stdio(0);
for (int i = 1; i < N; ++i) {
for (int j = i; j < N; ++j) lcm_[i][j] = lcm(i, j);
}
int t = 1;
cin >> t;
for (int _ = 1; _ <= t; ++_) {
// cout << "Case " << _ << ": ";
shelby();
}
}