#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 105;
const ll MOD = 1e9 + 7;
int n, ans = 0;
int dp[N][N][N][N];
int max_gcd(int ind, vector<int> &v, int gc, int gc2, int cnt) {
if(ind == n) {
if(cnt == (n + 1) / 2) {
ans = max(ans, gc + gc2);
return ans;
}
return 0;
}
if(dp[ind][gc][gc2][cnt] != -1) return dp[ind][gc][gc2][cnt];
return dp[ind][gc][gc2][cnt] = max(max_gcd(ind + 1, v, gcd(gc, v[ind]), gc2, cnt + 1),
max_gcd(ind + 1, v, gc, gcd(gc2, v[ind]), cnt));
}
void solve()
{
memset(dp, -1, sizeof dp);
cin >> n;
vector<int> v(n);
for(int i = 0; i < n; i++) {
cin >> v[i];
}
ans = 0;
cout << max_gcd(0, v, 0, 0, 0) << "\n";
}
int main()
{
ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
int t;
cin >> t;
while(t--){
solve();
}
}