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

const char iname[] = "podm.in";
const char oname[] = "podm.out";

#define MAXN  505
#define Min(a, b) ((a) < (b) ? (a) : (b))
#define FOR(i, a, b)  for (int i = (a); i <= (b); ++ i)
#define INF   100000000000000000LL

typedef long long i64;

i64 best[MAXN][MAXN], d[MAXN];
int n;
int main()
{
    ifstream in(iname);
    in >> n;
    FOR (i, 0, n)  in >> d[i];
    in.close();

    ofstream out(oname);
    FOR (i, 1, n)  best[i][i] = 0;
    FOR (i, 1, n - 1)  best[i][i + 1] = d[i - 1] * d[i] * d[i + 1];
    FOR (w, 2, n - 1) FOR (i, 1, n - w)
    {
        int j = i + w;
        best[i][j] = INF;
        FOR (k, i, j - 1)
        best[i][j] = Min(best[i][j], best[i][k] + best[k + 1][j] + d[i - 1] * d[k] * d[j]);
    }

    out << best[1][n] << '\n';
    out.close();
    return 0;
}