#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

long long optimal_par(vector<int> mat) {
	int n = mat.size();
	vector<vector<long long> > best(mat.size(), vector<long long>(n, 0));

	for (int l = 2; l < n; l++) {
		for (int i = 0; i + l < n; i++) {
			int j = i + l;
			best[i][j] = 100000000000000000LL;
			best[i][j] <<= 62;
			for (int k = i + 1; k < j; k++) {
				best[i][j] = min(best[i][j], best[i][k] + best[k][j] + mat[i] * mat[k] * mat[j]);
			}
		}
	}

	return best[0][n -1];
}

int main(void) {
	ifstream f("podm.in");

	int n;
	vector<int> mat;
	f >> n;

	for (int i = 0; i <= n; i++) {
		int val;
		f >> val;
		mat.push_back(val);
	}

	f.close();

	ofstream g("podm.out");
	g << optimal_par(mat);
	g.close();
}