#include <iostream>
#include <climits>
using namespace std;

int v[501];
long long a[500][500];

int main() {
	freopen("podm.in", "r", stdin);
	freopen("podm.out", "w", stdout);
	int n, i, j, k;
	long long x;
	cin >> n;
	for (i = 0; i < n + 1; i++) {
		cin >> v[i];
	}
	// the distance
	for (i = 1; i < n; i++) {
		// the current line
		for (j = 0; j + i < n; j++) {
			a[j][j+i] = LLONG_MAX;
			for (k = 0; k < i; k++) {
				x = a[j][j+k] + a[j+k+1][j+i];
				x += 1LL * v[j] * v[j+k+1] * v[i+j+1];
				if (a[j][j+i] > x) {
					a[j][j+i] = x;
				}
			}
		}
	}
	cout << a[0][n-1] << "\n";
	return 0;
}