#include <iostream>
#include <fstream>
#include <stdio.h>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <iomanip>
#include <stack>

#if 1
#define pv(x) cout<<#x<<" = "<<x<<"; ";cout.flush()
#define pn cout<<endl
#else
#define pv(x)
#define pn
#endif

using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");

#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
const int NMax = 5e2 + 5;
const ll inf = 1e18 + 5;

int N;
ll v[NMax],dp[NMax][NMax];

int main() {
    in>>N;

    for (int i=1;i <= N+1;++i) {
        in>>v[i];
    }

    for (int i=1;i < N;++i) {
        dp[i][i+1] = v[i]*v[i+1]*v[i+2];
    }

    for (int d=3;d <= N;++d) {
        for (int i=1;i + d - 1 <= N;++i) {
            int j = i + d - 1;
            dp[i][j] = inf;

            for (int k=i;k < j;++k) {
                ll val = dp[i][k] + dp[k+1][j] + v[i] * v[k+1] * v[j+1];
                dp[i][j] = min(dp[i][j],val);
            }
        }
    }

    out<<dp[1][N];

    return 0;
}