#include <iostream>
using namespace std;
typedef pair<int, int> pii;

const int MAXK = 1000;
const int INF = 1<<30; // 2 ^ 30

pii inp[MAXK+10];
int a[MAXK+10];
int d[MAXK+10][MAXK+10];

int main() {
	ios::sync_with_stdio(false);
	int k;
	cin >> k;
	for(int i=0; i<k; i++)
		cin >> inp[i].first >> inp[i].second;

	for(int i=1; i<k; i++){
		if( inp[i].first != inp[i-1].second ){
			cout << "matrix sizes are not valid" << endl;
			return 0;
		}
		a[i] = inp[i].first;
	}
	a[0] = inp[0].first;
	a[k] = inp[k-1].second;

	for(int i=0; i<k; i++)
		d[i][i] = 0;

	for(int len=1; len<=k; len++)
		for(int i=0; i<k; i++){
			if( i+len >= k )
				break;
			int j = i+len;

			d[i][j] = INF;
			for(int m=i; m<j; m++)
				d[i][j] = min( d[i][j] , d[i][m] + d[m+1][j] + a[i] * a[m+1] * a[j+1] );
		}

	cout << d[0][k-1] << endl;

	return 0;
}