#include <cstdio>
#include<algorithm>
using namespace std;

int v[505];
long long dp[505][505];

int main()
{
	freopen("podm.in", "r", stdin);
	freopen("podm.out", "w", stdout);
	int i, d, n;
	scanf("%d", &n);
	for(i = 1; i <= n + 1;++i)
		scanf("%d", &v[i]);

	for (d = 1; d < n; ++d)
		for (i = 1; i + d <= n; ++i) {
			dp[i][i + d] = 1LL << 60;
			for (int k = i, j = i + d; k < j; ++k)
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + 1LL * v[i] * v[k + 1] * v[j + 1]);
		}

	printf("%lld\n", dp[1][n]);
}