#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "podm";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

typedef long long int lld;
const int NMAX = 500 + 5;
const lld LINF = (1LL << 62) - 1;

int N;
lld A[NMAX];
lld D[NMAX][NMAX];

int main() {
    int i, j, k, d;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d", &N);

    for(i = 0; i <= N; i++)
        scanf("%lld", &A[i]);

    for(i = 1; i <= N - 1; i++)
        D[i][i + 1] = A[i - 1] * A[i] * A[i + 1];

    for(d = 3; d <= N; d++)
        for(i = 1, j = d; j <= N; i++, j++) {
            D[i][j] = LINF;
            for(k = i; k <= j - 1; k++)
                D[i][j] = min(D[i][j], D[i][k] + D[k + 1][j] + A[i - 1] * A[k] * A[j]);
        }

    printf("%lld\n", D[1][N]);

    return 0;
}