#include<bits/stdc++.h>
using namespace std;
int n,ans;
int a[202],f[202][202];
int main()
{
	freopen("energy.in","r",stdin);
	freopen("energy.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
	  scanf("%d",&a[i]);
	  a[i+n]=a[i];
	}
	a[2*n+1]=a[1];
	for(int l=2;l<=n;l++)
	for(int i=1;i+l-1<=2*n;i++)
	for(int k=i;k<i+l-1;k++)
	    f[i][i+l-1]=max(f[i][i+l-1],f[i][k]+a[i]*a[k+1]*a[i+l]+f[k+1][i+l-1]);
	for(int i=1;i<=n+1;i++)
	ans=max(ans,f[i][i+n-1]);
	printf("%d\n",ans);
	return 0;
}