#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int n,w[205],f[205][205];
int main()
{
int i,len,l,r,ans=0,k;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&w[i]);
w[i + n] = w[i];
}
for(len=3;len<=n+1;len++)for(l=1;l+len-1<=n*2;l++){
r=l+len-1;
for(k=l+1;k<r;k++)f[l][r]=max(f[l][r],f[l][k]+f[k][r]+w[l]*w[k]*w[r]);
}
for(l=1;l<=n;l++)ans=max(ans,f[l][l+n]);
printf("%d\n",ans);
return 0;
}