#include <fstream>
#define Nmax 503

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

int n,d[Nmax];

void ReadInput() {

    f>>n;
    for (int i=0; i<=n; ++i)
        f>>d[i];
}

unsigned long long PODM (int n, int d[Nmax]) {

    unsigned long long a[n][n];

//    for (int i=1; i<=n; ++i)
//        for (int j=1; j<=n; ++j) a[i][j]=0ULL;

    for (int i=1; i<=n; ++i) a[i][i]=0ULL;

    for (int i=1; i<n; ++i) a[i][i+1] = 1LL * d[i-1]*d[i]*d[i+1];

    for (int length=2; length<=n; ++length)
        for (int i=1; i+length-1 <= n; ++i) {

            int j=i+length-1;

            for (int k=i; k<j; ++k) {

                unsigned long long new_sol = a[i][k] + a[k+1][j] + 1ULL* d[i-1] * d[k] * d[j];
                if (a[i][j]==0) a[i][j]=new_sol;
                else a[i][j]=min(a[i][j],new_sol);
            }

        }
    g<<a[1][n]<<'\n';
//    for (int i=1; i<=n; ++i) {
//
//        for (int j=1; j<=n; ++j) g<<a[i][j]<<' ';
//        g<<'\n';
//    }
//    return a[1][n];
}

void Solve() {

    PODM(n, d);


}

int main() {

    ReadInput();
    Solve();

    f.close(); g.close();
    return 0;
}