#include <fstream>
#include <numeric>
#include <algorithm>

using namespace std;

const int MAX_N = 500 + 50;
const long long INF = numeric_limits <long long> :: max();

int v[MAX_N + 1];
long long D[MAX_N + 1][MAX_N + 1];

int main(void) 
{
    ifstream in("podm.in");
    ofstream out("podm.out");
    in.tie(0);
    ios_base::sync_with_stdio(0);
    int N;

    in >> N;
    for (int i = 0; i <= N; i++)
        in >> v[i];
    in.close();

    for (int j = 2; j <= N; j++)
    {
        for (int i = j - 1; i > 0; i--)
        {
            D[i][j] = INF;
            for (int k = i; k < j; k++)
                D[i][j] = min(D[i][j], D[i][k] + D[k + 1][j] + static_cast <long long> (v[i - 1]) * v[k] * v[j]);
        }
    }

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