#include <bits/stdc++.h>

using namespace std;

void solve(){
	int n;
	cin >> n;
	vector<int> v(n);
	for(auto &i:v) cin >> i;

	vector<int> gcd(n);
    int total = 1 << n; // 2^n subsets
    for (int mask = 1; mask < total; ++mask) {
        vector<int> subset;
        for (int i = 0; i < n; ++i) {
            if (mask & (1 << i)) {
                subset.push_back(v[i]);
            }
        }

		int k = subset.size();
		int z = subset[0];
        for (int x : subset) z = __gcd(z, x);
		
		gcd[k-1] += z;
	}

	int result = 1;
	for(auto i:gcd) result *= i;
	cout << result << "\n" ;
}

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