#include <iostream>
#include <fstream>
#define MAXN  505
#define min(a, b) ((a) < (b) ? (a) : (b))
#define INF   100000000000000000LL
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
long long bst[MAXN][MAXN], d[MAXN];   
int n;
int main()
{
    in >> n;
	int i,w,k;
    for (i=0; i<=n; i++)  in >> d[i];
    for (i=1; i<=n; i++)  bst[i][i] = 0;
    for (i=1; i<n; i++)  bst[i][i + 1] = d[i - 1] * d[i] * d[i + 1];
    for (w=2; w<n; w++) 
		for (i=1; i<=n-w; i++)
		{
			int j = i + w;
			bst[i][j] = INF;
		    for (k=i; k<=j-1; k++) 
				bst[i][j] = min(bst[i][j], bst[i][k] + bst[k + 1][j] + d[i - 1] * d[k] * d[j]);
    }
    out << bst[1][n];
    return 0;
}