#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define inf 0x7f7f7f7f
#define N 110
int a[N];
int dp[N][N];
int main(){
	int n;
	while(scanf("%d",&n)!=EOF){
		for(int i=0;i<n;i++){
			scanf("%d",&a[i]);
			fill(dp[i],dp[i]+n,inf);
		}
		for(int i=1;i<=n-2;i++){
			for(int j=0;j<n;j++){
				for(int h=j+1;(h<j+i+1)&&(j+i+1<n);h++){
					int temp=0;
					if(dp[j][h]==inf){
						temp+=0;
					}
					else temp+=dp[j][h];
					if(dp[h][j+i+1]==inf){
						temp+=0;
					}
					else temp+=dp[h][j+i+1];
					dp[j][j+i+1]=min(dp[j][j+i+1],temp+a[j]*a[h]*a[j+i+1]);
				}
			}
		}
		printf("%d\n",dp[0][n-1]);
	}
	return 0;
}