#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>

typedef long long int ll;
using namespace std;
#define INF 0x7FFFFFFF
#define N 200000

const int LIMIT = 1e+9;
int n, m;
pair<int, int> value[505];
int dp[505][505];

int solve(int left, int right) {
	if (left == right) {
		return dp[left][right] = 0;
	}
	if (dp[left][right] != -1) {
		return dp[left][right];
	}
	dp[left][right] = INF;
	for (int i = left; i < right; i++) {
		dp[left][right] = min(
			dp[left][right],
			solve(left, i) + solve(i + 1, right) + value[left].first * value[i].second * value[right].second
		);
	}
	return dp[left][right];
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> n;
	memset(dp, 0xFF, sizeof(dp));
	for (int i = 0; i < n; i++) {
		int a, b;
		cin >> a >> b;
		value[i] = { a, b };
	}
	cout << solve(0, n - 1);


	return 0;
}