#include <cstdio>
int n,a[600];
long long int an[600][600];

void calc();

int main()
{
	freopen ("podm.in","r",stdin);
	freopen ("podm.out","w",stdout);
	scanf("%d",&n);
	for (int i=0;i<=n;++i)
		scanf("%d",&a[i]);
	calc();
	printf("%lld",an[1][n]);
	return 0;
}

void calc()
{
	for (int d=1;d<=n;++d)
		for (int i=1;i<=n-d;++i)
		{
			int j=d+i;
			an[i][j]=(long long) 1<<62;
			for (int k=1;k<j;++k)
			{
				long long int x=an[i][k]+an[k+1][j]+(long long)a[i-1]*a[k]*a[j];
				if (x<an[i][j])
					an[i][j]=x;
			}
		}
}