#include <iostream>
#include <fstream>
#include <cstdlib>
#include <vector>
#include <stack>
#include <time.h>
#include <cstdlib>
#include <algorithm>

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

#define ll long long
#define ull unsigned long long
#define pb push_back
const ll inf = 1e18 + 5;
const int NMax = 5e2 + 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 d=1;d < N;++d) {

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

            int jLim = i+d;
            for (int j=i;j < jLim;++j) {
                ll val = dp[i][j] + dp[j+1][i+d] + v[i] * v[j+1] * v[i+d+1];
                if (val < dp[i][jLim]) {
                    dp[i][jLim] = val;
                }
            }
        }
    }

    out<<dp[1][N]<<'\n';

    in.close();out.close();
    return 0;
}