#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n, d[505], dp[505][505];
int main()
{
	int i, j, k, lg;
	fin >> n;
	for (i = 0; i <= n; i++)
		fin >> d[i];
	for(lg=2;lg<=n;lg++)
		for (i = 1; i <= n - lg + 1; i++)
		{
			j = i + lg - 1;
			dp[i][j] = dp[i][i] + dp[i + 1][j] + d[i - 1] * d[i] * d[j];
			for (k = i+1; k < j; k++)
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + d[i - 1] * d[k] * d[j]);
		}
	fout << dp[1][n];
	return 0;
}