#include <iostream>
#include <fstream>
using namespace std;

ifstream f ("podm.in");
ofstream g ("podm.out");

const long long INF = 1LL << 62,
                NMAX = 500;

int N;
short int D[NMAX+1];
long long M[NMAX+1][NMAX+1];

void calcul() {
    for (int d=1; d<N; d++) {
        for (int i=N-d-1; i>= 0; i--) {
            int j = i + d;
            M[i][j] = INF;
            for (int k=i; k<j; k++) {
                long long t = M[i][k] + M[k+1][j] + (long long) D[i] * D[k+1] * D[j+1];
                M[i][j] = min(M[i][j], t);
            }
        }
    }
}

int main()
{
    f >> N;
    for (int i=0; i<=N; i++)
        f >> D[i];
    calcul();
    g << M[0][N-1];
    f.close();
    g.close();
    return 0;
}