#include <stdio.h>
#include <string>
#define ll long long
#define NMAX 1<<9
#define INF 666666666666666LL 
using namespace std;
int n,d[NMAX];
ll best[NMAX][NMAX];
void read()
{
	scanf("%d",&n);
	int i;
	for (i=1; i<=n+1; i++)
		scanf("%d",&d[i]);
}
void solve()
{
	int i,j,k;
	ll nr;
	for (i=1; i<n; i++)
		for (j=1; j<=n-i; j++)
		{
			nr=INF;
			for (k=j; k<j+i; k++)
				nr=min(nr,best[j][k]+best[k+1][j+i]+(ll)d[j]*d[k+1]*d[j+i+1]);
			best[j][j+i]=nr;
		}
}
int main()
{
	freopen("podm.in","r",stdin);
	freopen("podm.out","w",stdout);
	read();
	solve();
	printf("%lld\n",best[1][n]);
	return 0;
}