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

#define MAXN 505
#define INF 100000000000000000LL

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

int n;
long long best[MAXN][MAXN], d[MAXN];

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

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

    for (int w = 2; w < n; w++) {
        for (int i = 1; i <= n - w; i++) {
            int j = i + w;
            best[i][j] = INF;
            for (int k = i; k < j; k++) {
                best[i][j] = min(best[i][j], best[i][k] + best[k + 1][j] + d[i - 1] * d[k] * d[j]);
            }
        }
    }

    g << best[1][n];

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