// I AM A MUSLIM

#include "bits/stdc++.h"

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#define fastIO std::ios::sync_with_stdio(0);std::cin.tie(0)
#define ll long long int
#define flush fflush(stdout)
#define bl printf("\n")
#define yn(a, b) printf("%s\n", a >= b ? "Yes":"No")
// #define int ll

using pii = std::pair<int,int>;

const int MOD = 1000000007;
// const int MOD = 998244353;
const int mxN = 101;
using vi = std::vector<int>;

int N, a[mxN];
std::vector<int> primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
int idx[mxN];

std::map<vi, int> g_ans;
std::vector<std::map<int,int>> tot(mxN);

int pw(int a, int b) {
    int res = 1;
    while (b--) res *= a;
    return res;
}

void calc(int at, vi cur) {
    if (at == N) {
        int g = 1;
        for (auto &p : primes) {
            int cnt = (cur[idx[p]] == 10 ? 0 : cur[idx[p]]);
            g *= pw(p,cnt);
        }
        g_ans[cur] = g;
        return;
    }
    calc(at+1, cur);
    for (auto &p : primes) {
        int v = idx[p];
        if (tot[at].find(p) != tot[at].end()) cur[v] = std::min(cur[v], tot[at][p]);
        else cur[v] = 0;
    }
    calc(at+1, cur);
}

// int fn(int at, int evc, vi pc) {
//     if (at == N) {
//         if (N%2==0) {
//             if (evc == (N-evc)) {
                
//             }
//             return 0;
//         }
//         if (evc+1 != (N-evc)) return 0;
//     }
//     int op1 = fn(at+1, evc, pc);
//     for (auto &p : primes) {
//         int v = idx[p];
//         if (tot[at].find(p) != tot[at].end()) pc[v] = std::min(pc[v], tot[at][p]);
//         else pc[v] = 0;
//     }
//     int op2 = fn(at+1, evc+1, pc);
//     return dp[at][evc][pc] = std::max(op1, op2);
// }

std::vector<std::vector<std::map<pii, int>>> dp(mxN, std::vector<std::map<pii, int>> (mxN));

int fn(int at, int ec, int eg, int og) {
    if (ec > N/2) return 0;
    if (at == N) {
        if (N&1) return (ec+1 == (N-ec)) ? eg+og : 0;
        return (ec == (N-ec)) ? eg+og : 0;
    }
    if (dp[at][ec].find(pii(eg,og)) != dp[at][ec].end()) return dp[at][ec][pii(eg,og)];
    int op1 = fn(at+1, ec, eg, std::__gcd(og, a[at]));
    int op2 = fn(at+1, ec+1, std::__gcd(eg, a[at]), og);
    return dp[at][ec][pii(eg,og)] = std::max(op1, op2);
}

signed main() {
    // fastIO;
    int testCases=1;
    scanf("%d",&testCases);
    // std::cin>>testCases;
    
    // for (int i = 0; i < (int)primes.size(); i++) {
    //     idx[primes[i]] = i;
    // }
    
    for (int TC = 1; TC <= testCases; TC++) {
        scanf("%d",&N);
        for (int i = 0; i < N; i++) {
            scanf("%d",&a[i]);
        }
        
        printf("%d\n", fn(0,0,0,0));
        
        // for (int i = 0; i < N; i++) {
        //     int x = a[i];
        //     for (auto &p : primes) {
        //         if (x <= 1) break;
        //         if (x%p == 0) {
        //             int c = 0;
        //             while (x%p == 0) {
        //                 x /= p;
        //                 c++;
        //             }
        //             tot[i][p] = c;
        //         }
        //     }
        //     if (x > 1) tot[i][x] = 1;
        // }
        
        // std::vector<int> cur(25,10);
        // calc(0,cur);
        
        // for (auto &i : g_ans) {
        //     for (auto j : i.first) printf("%d ",j);
        //     printf(" : %d\n",i.second);
        // }
        
        // std::vector<int> dum(25,10);
        // printf("%d\n", fn(0,0,dum));
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) dp[i][j].clear();
        }
        
    }
    
    return 0;
}

/*

*/