#include<stdio.h>
#define INF 1000000000000000000LL
#define LL long long
#define Nmax 502


int n,i,j,q,k;
LL d[Nmax];
LL a[Nmax][Nmax];

inline LL Min( LL a,LL b)
{
	return a>b?b:a;
}

int main()
{
	freopen("podm.in","r",stdin);
	freopen("podm.out","w",stdout);
	scanf("%d",&n);
	for(i=0;i<=n;++i) 
	{
			scanf("%d",&d[i]);
	//for(i=1;i<=n;++i)
			//a[i][i+1]=d[i-1]*d[i]*d[i+1];
		if (i>1)
			a[i-1][i]= (long long) d[i-2]*d[i-1]*d[i];
	}
	for (q=2;q<=n;++q)
		for (i=1;i+q-1<=n;++i)
		{
			j=i+q-1;
			a[i][j]=INF;
			for (k=i;k<j;++k)
				a[i][j]=Min(a[i][k]+a[k+1][j]+d[i-1]*d[k]*d[j],a[i][j]);
		}
	printf("%lld\n",a[1][n]);
	fclose(stdin); 
	fclose(stdout);
	return 0;
}