#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

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

const int INF = 1000000000000000;

unsigned long long L[100001], C[100001], X[10001][10001];
int n;

int main()
{
	f >> n;
	f >> L[1] >> C[1];
	for (int i = 2; i <= n + 1; ++i)
	{
		L[i] = C[i - 1];
		f >> C[i];

	}
	for (int i = n - 1; i >= 1; --i)
	{
		for (int j = i + 1; j <= n; ++j)
		{
			X[i][j] = INF;
			for (int k = i; k <= j - 1; ++k)
			{
				X[i][j] = min(X[i][j], X[i][k] + X[k + 1][j] + L[i] * C[k] * C[j]);
			}
		}
	}
	g << X[1][n];
	return 0;
}