#include <cstdio>
#include <algorithm>

using namespace std;

const long long inf=1<<25;
long long i,j,l,m[501][501],n,d[502],k;

int main () {
	
	freopen("podm.in","r",stdin);
	freopen("podm.out","w",stdout);
	
	scanf("%lld",&n);
	
	for(i=0;i<=n;i++)
		scanf("%lld",&d[i]);
	
	for(l=2;l<=n;l++){
		for(i=1;i<=n-l+1;i++){
			j=i+l-1;
			m[i][j]=inf;
			for(k=1;k<=j-1;k++)
				m[i][j]=min(m[i][j],m[i][k]+m[k+1][j]+d[i-1]*d[k]*d[j]);
		}
	}
	
	printf("%lld\n",m[1][n]);

	return 0;
}