/*
 *   Copyright (c) 2024 Emon Thakur
 *   All rights reserved.
 */
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using minheap = priority_queue<long long, vector<long long>, greater<long long>>;
typedef tree<int, null_type, greater_equal<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; // find_by_order, order_of_key

#define ll long long
#define ld long double
#define MOD 1000000007
#define pie 2*(acos(0.0))
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define pb push_back
#define endl '\n'
#define lcm(a,b) (a*b)/(__gcd<ll>(a,b))
#define print(v) for(auto e:v) cout<<e<<" "; cout<<endl;
#define printp(v) for(auto e:v) cout<<e.first<<" "<<e.second<<endl;
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define life_is_a_race ios::sync_with_stdio(false); cin.tie(nullptr);

vector<vector<ll>> alldiv(100006);
void alldivisor()
{
    for(int i=1;i<=100000;i++) alldiv[i].push_back(1);
    for(int i=2;i<=100000;i++)
    {
        alldiv[i].push_back(i);
        for(int j=i+i;j<=100000;j+=i) alldiv[j].push_back(i);
    }
}

bool cmp(pair<ll,ll>&a,pair<ll,ll>&b) {return a>b;}

void solve(int tc)
{
    //cout<<"Case "<<tc<<": ";
    ll n; cin >> n;
    vector<ll> a(n);
    for(int i=0;i<n;i++) cin >> a[i];
    vector<ll> hash(100005);

    for(int i=0;i<n;i++)
    {
        for(auto e:alldiv[a[i]])
        {
            hash[e]++;
        }
    }

    vector<pair<ll,ll>> v;
    for(int i=1;i<=100000;i++)
    {
        if(hash[i] >= (n/2)) 
        {
            v.push_back({hash[i],i});
        }
    }

    sort(v.begin(),v.end(),cmp);
    printp(v);
    ll ans = 2;

    int m = v.size();
    for(int i=0;i<m;i++)
    {
        //cout << v[i].first <<" "<< v[i].second<<endl;
        //if(v[i].first < (n+1)/2) break;

        for(int j=i;j<m;j++)
        {
            //cout << v[j].first <<" "<<v[j].second<<endl;
            //if(v[j].first < n/2) break;
            ll lcmm = lcm(v[i].second,v[j].second);
            ll cnt;
            if(lcmm > 100000) cnt = 0;
            else cnt = hash[lcmm];

            if(v[i].first + v[j].first - cnt >= n) 
            {
                ans = max(ans , v[i].second + v[j].second);
            }
        }
    }

    cout << ans << endl;

    //for(int i=1;i<=10;i++) cout << i << " "<<hash[i]<<endl;
}
int main()
{
    //life_is_a_race
    alldivisor();
    
    int t=1; 
    cin>>t;
    for(int i=1;i<=t;i++) solve(i);
}