#include <cstdio>

#include <cstring>

#include <iostream>

using namespace std;

typedef long long ll;

const int maxn=100010;

int n,m,k;

ll ans;

struct node

{

	int x;

	ll g;

}p[maxn],q[maxn];

ll gcd(ll a,ll b)

{

	return (!b)?a:gcd(b,a%b);

}

inline ll rd()

{

	ll ret=0,f=1;	char gc=getchar();

	while(gc<'0'||gc>'9')	{if(gc=='-')f=-f;	gc=getchar();}

	while(gc>='0'&&gc<='9')	ret=ret*10+gc-'0',gc=getchar();

	return ret*f;

}

void work()

{

	n=rd(),ans=0;

	int i,j;

	ll v;

	m=0;

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

	{

		v=rd();

		for(j=1;j<=m;j++)	p[j].g=gcd(p[j].g,v);

		p[++m].g=v,p[m].x=i;

		for(k=0,j=1;j<=m;j++)	if(p[j].g>p[j-1].g)	q[++k]=p[j];

		for(j=1;j<=k;j++)	p[j]=q[j],ans=max(ans,(i-p[j].x+1)*p[j].g);

		m=k;

	}

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

}

int main()

{

	int T=rd();

	while(T--)	work();

	return 0;

}