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

#define MAXN 503
#define MAXP 10010
#define INF 100000000346LL

int main () {

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

int n, i;
int p[MAXP];
long int m[MAXN][MAXN];
int s[MAXN][MAXN];
int l, k, q = 0, j;

in >> n;

for (i = 0; i <=n; i++)
        in >> p[i];

for (i = 1; i <= n; i++)
    m[i][i] = 0;

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

        j = i + l - 1;
        m[i][j] = INF;

        for (k = i; k <= j - 1; k++) {
            q = m[i][k] + m[k + 1][j] + p[i - 1]*p[k]*p[j];

            if (q < m[i][j]) {
                    m[i][j] = q;
                    s[i][j] = k;

            }
        }
    }

    out << m[1][n];




   in.close();
   out.close();


}