#include<cstdio>

#include<iostream>

#include<algorithm>

#define N 100001

using namespace std;

typedef long long LL;

LL a[N];

void read(LL &x)

{

    x=; char c=getchar();

    while(!isdigit(c)) c=getchar();

    while(isdigit(c)) { x=x*+c-''; c=getchar(); }

}

struct node

{

    int sum,s[];

    LL gcd[];

}cur,nxt;

LL getgcd(LL a,LL b) { return !b ? a : getgcd(b,a%b); }

int main()

{

    int T,n;

    LL ans,g;

    scanf("%d",&T);

    while(T--)

    {

        scanf("%d",&n);

        for(int i=;i<=n;i++)

        read(a[i]);

        cur.gcd[]=a[]; cur.sum=cur.s[]=;

        ans=a[];

        for(int r=;r<=n;r++)

        {

            nxt.sum=;

            nxt.s[]=cur.s[];

            nxt.gcd[]=getgcd(cur.gcd[],a[r]);

            for(int l=;l<=cur.sum;l++)

            {

                g=getgcd(cur.gcd[l],a[r]);

                if(g!=nxt.gcd[nxt.sum])

                {

                    ans=max(ans,nxt.gcd[nxt.sum]*(r-nxt.s[nxt.sum]+));

                    nxt.sum++;

                    nxt.gcd[nxt.sum]=g;

                    nxt.s[nxt.sum]=cur.s[l];

                }

            }

            ans=max(ans,nxt.gcd[nxt.sum]*(r-nxt.s[nxt.sum]+));

            if(a[r]!=nxt.gcd[nxt.sum])

            {

                nxt.gcd[++nxt.sum]=a[r],nxt.s[nxt.sum]=r;

                ans=max(ans,a[r]);

            }

            cur=nxt;

        }

        printf("%lld\n",ans);

    }

}