#include <iostream>
using namespace std;
int n,a[405],dp[405][405];
int main(){
	cin>>n;
	for(int i = 1;i<=n;i++){
		cin>>a[i];
		a[n+i]=a[i];
	}
	
	for(int i = 2;i<=n;i++){
		for(int l = 1;l+i-1<2*n;l++){
			int r=l+i-1;
			for(int k = l;k<r;k++){
				dp[l][r]=max(dp[l][r],dp[l][k]+dp[k+1][r]+a[l]*a[k+1]*a[r+1]);
			}
				
			
			
			
			
		} 
	}
	int maxn=0;
	for(int i = 1;i<=n;i++){
		maxn=max(maxn,dp[i][i+n-1]);
	}
	cout<<maxn<<endl;
	return 0;
}