#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#define maxn 100100
using namespace std;
typedef long long ll;
 
struct node{
    ll num,pos;
}cur;
 
ll gcd(ll x,ll y) { return y==0?x:gcd(y,x%y); }
 
ll a[maxn],n,m,k,t,ans;
vector<node> f[maxn];
 
int main()
{
    cin>>t;
    while (t--)
    {
        cin>>n;
        for (ll i=1; i<=n; i++) cin>>a[i],f[i].clear();
        ans=max(n,a[1]);
        cur.num=a[1],cur.pos=1;
        f[1].push_back(cur);
        for (int i=2; i<=n; i++)
        {
            for (unsigned j=0; j<f[i-1].size(); j++)
            {
                cur.num=gcd(a[i],f[i-1][j].num);
                cur.pos=f[i-1][j].pos;
                bool flag=false;
                for (unsigned k=0; k<f[i].size(); k++)
                {
                    if (f[i][k].num==cur.num)
                    {
                        f[i][k].pos=min(f[i][k].pos,cur.pos);
                        flag=true;
                        break;
                    }
                }
                if (!flag) f[i].push_back(cur);
            }
            cur.num=a[i];
            cur.pos=i;
            bool flag=false;
            for (unsigned k=0; k<f[i].size(); k++)
            {
                if (f[i][k].num==cur.num)
                {
                    f[i][k].pos=min(f[i][k].pos,cur.pos);
                    flag=true;
                    break;                    
                }
            }
            if (!flag) f[i].push_back(cur);
 
            for (unsigned j=0; j<f[i].size(); j++)
                ans=max(ans,f[i][j].num*(i-f[i][j].pos+1));
        }
        cout<<ans<<endl;
    }
    return 0;
}