#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;

const int mod=1e9+7;
const int modu=1999999973;
const int modul=998244353;

const int nmax=1000005;

int n,d[505],dp[505][505];

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    ifstream cin("podm.in");
    ofstream cout("podm.out");
    cin >> n;
    for(int i=1;i<=n+1;i++) cin >> d[i];
    for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) dp[i][j]=1e18;
    for(int i=1;i<=n;i++) dp[i][i]=0;
    for(int i=1;i<n;i++) dp[i][i+1]=d[i]*d[i+1]*d[i+2];
    for(int i=2;i<n;i++){
        for(int j=1;j<=(n-i);j++){
            for(int k=j;k<=j+i-1;k++){
                dp[j][i+j]=min(dp[j][i+j],dp[j][k]+dp[k+1][i+j]+d[j]*d[i+j+1]*d[k+1]);
            }
        }
    }
    cout << dp[1][n] << '\n';
}