#include <iostream>
#include <fstream>

using namespace std;

typedef long long lint;

const int maxn = 505;
const lint inf = 1LL << 60;

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

int n, i, j, k;

lint v[maxn], d[maxn][maxn];

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

    for(i = 1; i <= n - 1; i ++) {
        d[i][i + 1] = v[i-1] * v[i] * v[i+1];
    }

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

            d[i][j] = inf;

            for(k = i; k <= j - 1; k ++) {
                d[i][j] = min(d[i][j], d[i][k] + d[k + 1][j] + v[i - 1] * v[k] * v[j]);
            }

        }
    }

    g << d[1][n] << '\n';

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