// 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;

int N, a[mxN], dp[mxN][mxN][mxN];

int fn(int at, int evC, int evG, int odG) {
    if (at == N) {
        if (N&1) return ((evC+1) == (N-evC)) ? evG+odG : -100100;
        return (evC == (N-evC)) ? evG+odG : -100100;
    }
    if (dp[at][evC][evG] != -1) return dp[at][evC][evG];
    int op1 = fn(at+1, evC+1, std::__gcd(evG,a[at]), odG);
    int op2 = fn(at+1, evC, evG, std::__gcd(odG,a[at]));
    return dp[at][evC][evG] = std::max(op1, op2);
}

signed main() {
    // fastIO;
    int testCases=1;
    scanf("%d",&testCases);
    // std::cin>>testCases;
    
    for (int TC = 1; TC <= testCases; TC++) {
        scanf("%d",&N);
        for (int i = 0; i < N; i++) {
            scanf("%d",&a[i]);
        }
        memset(dp,-1,sizeof(dp));
        printf("%d\n", fn(0,0,0,0));
        
    }
    
    return 0;
}

/*

*/