#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 = 1e6;

void solve()
{
  int n;
  cin >> n;
  int ar[n + 3];
  for (int i = 1; i <= n; i++)
  {
    cin >> ar[i];
  }

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

  for (int i = 1; i <= 100; i++)
  {

    for (int j = 1; j <= 100; j++)
    {
      int both = 0, first = 0, second = 0, flg = 0;
      for (int k = 1; k <= n; k++)
      {
        if (ar[k] % i == 0 && ar[k] % j == 0)
        {
          both++;
        }
        else if (ar[k] % i == 0)
        {
          first++;
        }
        else if (ar[k] % j == 0)
        {
          second++;
        }
        else
        {
          flg = 1;
          break;
        }
      }

      if (flg == 0)
      {
        if(first > even && first > odd) {
          continue;
        } 

        if(second > even && second > odd) {
          continue;
        }

        ans = max (ans, i + j);
      }
    }
  }
  cout << ans << endll;
}

int32_t main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t = 1;
  cin >> t;
  while (t--)
  {
    solve();
  }
  return 0;
}