#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbg(a,b,c,d) cerr<<a<<"  "<<b<<"  "<<c<<"  "<<d<<endl;
#define kill(a) {cout<<a<<endl;continue;}
#define KILL(a) {cout<<a<<endl;return 0;}
#define debug cerr<<"Error Found"<<endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define lcm(a, b) (a/__gcd(a,b))*b
#define w(t) cin>>t;while(t--)
#define pi  2 * acos(0.0)
#define endl "\n"
int t, cs = 0;
const int mxn = 2e5 + 3, mod = 1e9 + 7;

int32_t main()
{

    //fast
    w(t)
    {
        int n;
        cin >> n;
        int ar[n + 1];
        for(int i = 1; i <= n; i++)cin >> ar[i];
        int mx = 0;
        for(int i = 1; i <= 100; i++)
        {
            for(int j = i; j <= 100; j++)
            {
                int x = 0, y = 0, z = 0;
                for(int k = 1; k <= n; k++)
                {
                    z += (ar[k] % i == 0 and ar[k] % j == 0);
                    x += (ar[k] % i == 0);
                    y += (ar[k] % j == 0);
                }
                int cnt = x - z;
                int tnc = y;
                if(cnt == (n + 1) / 2 and tnc == n / 2)mx = max(mx, i + j);
                if(cnt == n / 2 and tnc == (n + 1) / 2)mx = max(mx, i + j);
                cnt = x, tnc = y - z;
                if(tnc == (n + 1) / 2 and cnt == n / 2)mx = max(mx, i + j);
                if(tnc == n / 2 and cnt == (n + 1) / 2)mx = max(mx, i + j);
            }
        }
        cout << mx << endl;
    }
}