#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

void solve() {
    int n, ans = 0;
    cin >> n;
    vector<int> v(n);
    for(int i = 0; i < n; i++) cin >> v[i];

    for(int g1 = 1; g1 <= 100; g1++) {
        vector<int> tmp;
        int g2 = -1;
        for(int i = 0; i < n; i++) {
            if(v[i] % g1 == 0) {
                tmp.pb(v[i] / g1);
            }
            else {
                if(g2 == -1) g2 = v[i];
                else g2 = __gcd(g2, v[i]);
            }
        }

        if(n / 2 <= tmp.size()) {
            int res = int(tmp.size()) - (n >> 1);
            if(g2 == -1) {
                for(int i = 0; i < tmp.size(); i++) {
                    int t = res - 1, g = tmp[i];
                    for(int j = 0; j < tmp.size() && t > 0; j++) {
                        if(i == j) continue;
                        if(v[j] % g == 0) --t;
                    }
                    if(t == 0) g2 = max(g2, g);
                }
                if(g2 > 0) res = 0;
            }
            else {
                for(auto &i: tmp) {
                    if(res == 0) break;
                    if(i % g2 == 0) --res;
                }
            }
            
            if(res == 0) {
                ans = max(ans, g1 + g2);
            }
        }
    }
    cout << ans << endl;
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}