#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cstdio>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <stack>
#include <map>
using namespace std;
#define int long long
int a[5005];
signed main()
{
	int t;
	scanf("%lld",&t);
	while(t--)
	{
		int n;
		scanf("%lld",&n);
		for(int i=1;i<=n;i++)
		{
			scanf("%lld",&a[i]);
		}
		int ans=0;
		for(int i=2;i<n;i++)
		{
			int ans1=0;
			int ans2=0;
			for(int j=1;j<i;j++)
			{
				int h=min(a[i],a[j]);
				ans1=max(ans1,(i-j)*h);
			}
			for(int j=i+1;j<=n;j++)
			{
				int h=min(a[i],a[j]);
				ans2=max(ans2,(j-i)*h);
			}
			ans=max(ans,ans1+ans2);
		}
		printf("%lld\n",ans);
	}
	return 0;
}