#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string.h>
#include <stdlib.h>
using namespace std;
#define NMax 50000
int N, M[NMax];
#define INF   100000000000000000LL
#define Min(a, b) ((a) < (b) ? (a) : (b))
int best[NMax/10][NMax/10];
int main()
{
	FILE *f = fopen("podm.in", "r");
	FILE *g = fopen("podm.out", "w");
	fscanf(f, "%d", &N);
	for (int i=0; i<=N; i++)
		fscanf(f, "%d", &M[i]);
	for (int i=1; i<=N; i++)
		best[i][i] = 0;
	for (int i=1; i<=N-1; i++)
		best[i][i+1] = M[i-1] * M[i] * M[i+1];
	for (int z = 2; z <= N-1; z++)
		for (int i = 1; i<= N-z; i++)
		{
			int j = i + z;
			best[i][j] = INF;
			for (int k=i; k<=j-1; k++)
				best[i][j] = Min (best[i][j], best[i][k] + best[k+1][j] + M[i-1] * M[k] * M[j]);
		}
	fprintf(g, "%d", best[1][N]);
	fclose(f);
	fclose(g);
 	return 0;
}