rt,

#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
int t,n,gcd[100001][20],lg[100001],maxx;
int get(int l,int r) {
    int t = lg[r - l + 1];
    return __gcd(gcd[l][t],gcd[r - (1 << t) + 1][t]);
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> t;
    while(t--) {
        cin >> n;
        lg[0] = -1;
        for(int i = 1; i <= n; i++) {
            cin >> gcd[i][0];
            lg[i] = lg[i >> 1] + 1;
        }
        for(int j = 1; j <= lg[n]; j++) {
            for(int i = 1; i + (1 << j) - 1 <= n; i++) {
                gcd[i][j] = __gcd(gcd[i][j - 1],gcd[i + (1 << (j - 1))][j - 1]);
            }
        }
        for(int i = 1; i <= n; i++) {
            int j = i + 1,l,r,ans;
            while(j < n) {
                l = j,r = n + 1;
                int x = get(i,j);
                while(r - l > 1) {
                    int mid = (l + r) >> 1;
                    if(get(i,mid) == x)l = mid,ans = l;
                    else r = mid;
                }
                maxx = max(x * (ans - i + 1),maxx);
                j = r + 1;
            }
        }
        cout << maxx << endl;
maxx = 0;
    }
}