#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
#define ll long long
const ll MAX=1LL<<62;
int n;
ll a[500][500];
vector <int> b;
int main()
{
	freopen("podm.in","r",stdin);
	freopen("podm.out","w",stdout);
	scanf("%d",&n);
	for(int i=0;i<=n;i++)
	{
		int x;
		scanf("%d",&x);
		b.push_back(x);
	}
	//for(int i=1;i<n;i++)
	//	a[i][i+1]=b[i-1]*b[i]*b[i+1];
	for(int j=1;j<n;j++)
	{
		for(int i=1;i+j<=n;i++)
		{
			int J=i+j;
			a[i][J]=MAX;
			for(int k=i;k<J;k++)
			{
				int sum=b[i-1]*b[k]*b[J];
				a[i][J]=min(a[i][k]+a[k+1][J]+sum,a[i][J]);
			}
		}
	}
	printf("%Ld\n",a[1][n]);
	return 0;
}