#include <bits/stdc++.h>

using namespace std;

#define ll long long

const ll NMax = 505;
const ll INF = 1LL << 62;

ll n;
ll a[NMax];
ll dp[NMax][NMax];

int main(){
    freopen("podm.in","r",stdin);
    freopen("podm.out","w",stdout);
    scanf("%d",&n);
    for(ll i = 1; i <= n + 1; ++i)
        scanf("%d",&a[i]);
    for(ll i = 1; i <= n; ++i){
        for(ll j = 1; j <= n; ++j){
            dp[i][j] = INF;
            if(i == j)
                dp[i][j] = 0;
        }
    }
    for(ll i = 1; i < n; ++i){
        dp[i][i + 1] = a[i] * a[i + 1] * a[i + 2];
    }
    for(ll l = 3; l <= n; ++l){
        for(ll i = 1; i + l - 1 <= n; ++i){
            for(ll k = 1; k <= l; ++k){
                dp[i][i + l - 1] = min(dp[i][i + l - 1], dp[i][i + k - 1] + dp[i + k][i + l - 1] + a[i] * a[i + k] * a[i + l]);
            }
        }
    }
    printf("%lld\n",dp[1][n]);
}