#include<fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");

long long int n, p[501],m[501][501];

int min(int a, int b) {
	if (a < b) return a;
	else return b;
}

void paranteze() {
	for (int l = 2; l <= n; l++) {
		for (int i = 1; i < n-l+2; i++) {
			int j = i + l - 1;
			m[i][j] = 1 << 30;
			for (int k = i; k < j; k++) {
				m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + p[i-1] * p[k] * p[j]);
			}
		}
	}
	fout << m[1][n];
}

int main() {
	fin >> n;
	for (int i = 0; i < n+1; i++)
		fin >> p[i];
	paranteze();
	return 0;
}