#include <cstdio>
#include <fstream>
#include <algorithm>

using namespace std;

const long long oo=(long long)1<<60;
long long m[512][512],v[512];

int main ()
{
	
	int n,k,i,j,d;
	ifstream f ("podm.in");
	freopen ("podm.out","w",stdout);
	f>>n;
	for(i=0;i<=n;++i){
		f>>v[i];
		for(j=0;j<=n;++j)
			m[i][j]=oo;
		m[i][i]=0;
		}
	for(i=1;i<n;++i)
		for(j=i+1;j<=n;++j){
			d=j-i;
			for(k=d;k<j;++k)
				m[d][j]=min(m[d][j],m[d][k]+m[k+1][j]+v[d-1]*v[k]*v[j]);
			}
	printf("%lld",m[1][n]);
	
	return 0;}