#include <iostream>
#include <fstream>
#include <algorithm>
#include <climits>

using namespace std;
int n;
long long dp[505][505];
long long d[505];

int main() {
    ifstream f("podm.in");
    ofstream g("podm.out");
    f>>n;
    for (int i = 0; i <= n; ++i) {
        f>>d[i];
    }
    for (int s = 1; s < n; ++s) {
        for (int i = 0, j = s; i < n && j < n; ++i, ++j) {
            dp[i][j] = LLONG_MAX;
            for(int k = i; k < j; ++k)
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + d[i]*d[k+1]*d[j+1]);

        }
    }
    g<<dp[0][n - 1];
    return 0;
}