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

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

int n;
long long m[501][501], d[502];
const long long INF = 1e12;

int main()
{
    in >> n;
    for (int i = 1; i <= n + 1; ++i)
        in >> d[i];
    in.close();

    for (int i = 1; i <= n; ++i) {
        for (int j = i + 1; j <= n; ++j)
            m[i][j] = INF;
    }

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

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

    out << m[1][n];
    out.close();

    return 0;
}