#include<stdio.h>
int n,v[1<<9];
long long d[1<<9][1<<9];

inline long long min(long long a, long long b)
{
	if(a<b)
		return a;
	return b;
}

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