#include <bits/stdc++.h>
#define MAXN 505

using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");

int main() {
	int N;
	long long D[MAXN] = {0};
	
	f >> N;
	for (int i = 0; i <= N; ++i) {
		f >> D[i];	
	}
	
	long long dp[MAXN][MAXN];
	for (int i = 1; i < N; ++i) {
		dp[i][i + 1] = D[i - 1] * D[i] * D[i + 1];
	}

	// m[i][i + k] = MIN(m[i][j] + m[j + 1][i + k] + D[i - 1] * D[j] * D[i + k])
	for (int step = 2; step < N; ++step) {
		for (int i = 1; i + step <= N; ++i) {
			int j = i + step;
			dp[i][j] = LONG_LONG_MAX;
			for (int k = i; k < j; ++k) {
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + D[i - 1] * D[k] * D[j]);
			}
		} 
	}
	g << dp[1][N];
	return 0;
}