#include <bits/stdc++.h>
#define ll long long
#define endll '\n';
#define pb push_back
#define all(v) v.begin(), v.end()
using namespace std;

const int mod = 1e9 + 7, N = 1e5 + 9;
vector<int> divv[N + 3];
int vis[N + 4];
void solve()
{
  int n;
  cin >> n;
  int ar[n + 3];
  vector<int> all_div, backup;
  map<int, int> mp;
  vector<int> v;
  for (int i = 1; i <= n; i++)
  {
    cin >> ar[i];
    if (i == 1)
    {
      for (auto j : divv[ar[i]])
      {
        all_div.push_back(j);
        mp[j]++;
      }
    }
  }

  int even = n / 2, odd = n - even, ans = 0;

  for (int i = 0; i < all_div.size(); i++)
  {

    int ii = all_div[i];

    for (int k = 1; k <= n; k++)
    {
      if (ar[k] % ii != 0)
      {
        // cout << ar[k] << " = " << endll;
        for (auto ff : divv[ar[k]])
        {
          // cout << ff << " ";
          mp[ff]++;
        }
        // cout << endll;
        // break;
      }
    }
  }

  for (auto i : mp)
    backup.pb(i.first);
  all_div = backup;
  // for(auto i : all_div) {
  //   cout << i << " " << endll;
  // }

  for (int i = 0; i < all_div.size(); i++)
  {

    int ii = all_div[i];

    for (int j = i; j < all_div.size(); j++)
    {
      int jj = all_div[j];
      // cout << ii << " " << jj << endll;
      int both = 0, first = 0, second = 0, flg = 0;
      for (int k = 1; k <= n; k++)
      {
        if (ar[k] % ii == 0 && ar[k] % jj == 0)
        {
          both++;
        }
        else if (ar[k] % ii == 0)
        {
          first++;
        }
        else if (ar[k] % jj == 0)
        {
          second++;
        }
        else
        {
          flg = 1;
          break;
        }
      }

      if (flg == 0)
      {
        if (ii == jj)
        {
          if (both == n)
          {
            ans = max(ans, ii + jj);
            continue;
          }
        }
        if (first > even && first > odd)
        {
          continue;
        }

        if (second > even && second > odd)
        {
          continue;
        }
        ans = max(ans, ii + jj);
      }
    }
  }
  // cout << all_div.size() << endl;
  cout << ans << endll;
}

int32_t main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t = 1;

  for (int i = 1; i <= N; i++)
  {
    for (int j = i; j <= N; j += i)
    {
      divv[j].pb(i);
    }
  }

  cin >> t;
  while (t--)
  {
    solve();
  }
  return 0;
}