#include <bits/stdc++.h>
using namespace std;

int main(void) {
	int n, i, j, k, len;
	cin >> n;
	int p[n + 1], m[n + 1][n + 1];
	for (i = 0; i <= n; i++)
	{
		if (i == 0) {
			cin >> p[i];
		} else if (i == 1) {
			cin >> p[i];
		} else {
			cin >> p[i] >> p[i];
		}
	}

	for (i = 1; i <= n; i++) 
		m[i][i] = 0;

	for (len = 2; len <= n; len++) {
		for (i = 1; i <= n - len + 1; i++) {
			j = i + len - 1;
			m[i][j] = INT_MAX;
			for (k = i; k < j; k++) {
				m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j]);
			}
		}
	}
	cout << m[1][n] << endl;
}
