#include <bits/stdc++.h>
using namespace std;
int n,a[10000],dp[10000][10000];
int main(){
	scanf("%d",&n);
	for(int i = 1;i<=n;i++)scanf("%d",&a[i]);
	for(int len = 3;len<=n;len++)
		for(int i = 1;i+len-1<=n;i++){
			int j = i+len-1;
			dp[i][j] = 1e9;
			for(int k = i+1;k<j;k++)dp[i][j] = max(dp[i][j],dp[i][k]+dp[k][j]+a[i]*a[k]*a[j]);
		}
	printf("%d",dp[1][n]);
	return 0;
}