#include <cstdio>
bool check[11001];
long n;
long data[21001];
long sawed[11001],cnt;
long ans;
FILE *op;
void set()
{
    int i;
    for(i=1;i<=10000;i++)
    {
        check[i]=false;
    }
    cnt=0;
    ans=-1;
}
void input()
{
    int i;

    scanf("%ld",&n);
    for(i=0;i<n;i++)
    {
        scanf("%ld",&data[i]);
        if(!check[data[i]])
        {
            check[data[i]]=true;
            sawed[cnt++]=data[i];
        }
    }
}
void makeans(long i,long f,long indexOfsawing)
{
    long area;
    area=sawed[indexOfsawing]*(i-f);
    if(area>ans)ans=area;
}
void process(long s,long e,long indexOfsawing)
{
    long i,f=s;
    if(indexOfsawing==cnt)return;
    if(s>e)return;
    if(ans>=sawed[cnt-1]*(e-s+1))return;
    for(i=s;i<=e;i++)
    {
        if(sawed[indexOfsawing]>data[i])
        {
            makeans(i,f,indexOfsawing);
            process(f,i-1,indexOfsawing+1);
            f=i+1;
        }
        else if(i==e)
        {
            makeans(e+1,f,indexOfsawing);
            process(f,e,indexOfsawing+1);
        }
    }


}
void qsort(long a[],long n)
{
    long p,t;
    long i,j;
    if(n>1)
    {
        p=a[n-1];
        i=-1;
        j=n-1;
        while(1)
        {
            while(a[++i]<p);
            while(a[--j]>p);
            if(i>=j)break;
            t=a[i];
            a[i]=a[j];
            a[j]=t;
        }
        t=a[i];
        a[i]=a[n-1];
        a[n-1]=t;
        qsort(a,i);
        qsort(a+i+1,n-i-1);
    }

}
int main()
{
    int C;
    scanf("%d",&C);
    while(C--)
    {
        set();
        input();
        qsort(sawed,cnt);
        ans=(sawed[0]*n);
        process(0,n-1,1);
        printf("%ld\n",ans);
    }
    return 0;
}