#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

int v[505];
long long dp[505][505];

long long rec(int i,int j)
{
	long long &ref=dp[i][j];
	if(ref!=-1)
		return ref;
	if(i==j)
		return ref=0;
	
	long long minim=(long long)1<<60;
	for(int k=i;k<=j-1;k++)
		minim=min(minim,rec(i,k)+rec(k+1,j)+v[i-1]*v[k]*v[j]);
	return ref=minim;
}

int main()
{
	int n;
	memset(dp,-1,sizeof(dp));
	freopen("podm.in","r", stdin);
	freopen("podm.out","w", stdout);
	scanf("%d",&n);
	for(int i=0;i<=n;i++)
		scanf("%d",&v[i]);
	
	printf("%lld",rec(1,n));
	//for(int i=1;i<=n;i++,cout<<endl)
		//for(int j=1;j<=n;j++)
			//cout<<dp[i][j]<<" ";
	return 0;
}