MCM

/*
    Task    : MCM
    Author  : Phumipat C. [MAGCARI]
    Language: C++
    Created : 08 January 2023 [09:52]
*/
#include<bits/stdc++.h>
using namespace std;
struct A{
    int r,c;
};
A a[110];
int dp[110][110];
int recur(int l,int r){
    if(l == r)      return 0;
    if(dp[l][r])    return dp[l][r];
    int mn = 1e9;
    for(int k=l;k<r;k++){
        int now = recur(l,k) + recur(k+1,r) + a[l].r * a[k].c * a[r].c;
        mn = min(mn,now);
    }
    return dp[l][r] = mn;
}
int main(){
    int n;
    cin >> n;
    for(int i=1;i<=n;i++)
        cin >> a[i].r >> a[i].c;
    printf("%d\n",recur(1,n));
    return 0;
}