1780B.cpp

#include <bits/stdc++.h>
using namespace std;

#define pii pair<int, int>
#define vt vector
#define ll long long
#define pb push_back
#define ioa insert_or_assign
#define umap unordered_map
#define prq priority_queue
#define F first
#define S second
#define all(c) (c).begin(), (c).end()
#define rev(c) (c).rbegin(), (c).rend()
#define sz(x) (int)(x).size()
#define mset(ar, val) memset(ar, val, sizeof(ar))
#define en "\n"

const int d4r[4] = {-1,0,1,0}; const int d4c[4] = {0,1,0,-1};
const int d8r[8] = {-1,-1,0,1,1,1,0,-1}; const int d8c[8] = {0,1,1,1,0,-1,-1,-1};
const int INF = 0x3f3f3f3f; const int mINF = 0xc0c0c0c0;
const ll LINF = 0x3f3f3f3f3f3f3f3f; const ll mLINF = 0xc0c0c0c0c0c0c0c0;
int T = 1;

ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b,a%b); }

void sol() {
	int n;
	cin >> n;
	vt<ll> v(n);
	for(ll &x : v) cin >> x;

	vt<ll> g1, g2;
	g1.pb(v[0]);
	for(int i=1; i<n; ++i) {
		g1.pb(g1.back()+v[i]);
	}

	g2.pb(v[n-1]);
	for(int i=n-2; ~i; --i) {
		g2.pb(g2.back()+v[i]);
	}

	ll ans = mINF;
	for(int i=0; i<n-1; ++i) {
		ans = max(ans, gcd(g1[i], g2[n-2-i]));
	}

	cout << ans << en;

	return;
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> T;
	while(T--) {
		sol();
	}

	return 0;
}