#include <fstream>

using namespace std;

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

int n;
long long d[505];
long long dp[505][505];

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

void solve()
{
    for (int aux = 1; aux <= n; ++aux) {
        for (int i = 1; i <= n-aux; ++i) {
            dp[i][i+aux] = 1000000000;
            for (int k = i; k < i+aux; ++k) {
                dp[i][i+aux] = min(dp[i][i+aux], dp[i][k] + dp[k+1][i+aux] + d[i-1] * d[k] * d[i+aux]);
            }
        }
    }
    g<<dp[1][n];
}

int main() {
    read();
    solve();
    return 0;
}