#include <bits/stdc++.h>

using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n, v[550];
long long dp[550][550];
int main()
{
    fin >> n;
    for (int i = 1; i <= n + 1; ++i) {
        fin >> v[i];
    }
    for (int i = 1; i <= n - 1; ++i) {
        dp[i][i] = 0;
        dp[i][i + 1] = 1LL * v[i + 1] * v[i] * v[i + 2];
    }
    for (int l = 3; l <= n; ++l) {
        for (int i = 1; i <= n - l + 1; ++i) {
            int j = i + l - 1;
            dp[i][j] = LLONG_MAX;
            for (int k = i; k <= j - 1; ++k) {
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + 1LL * v[i] * v[k + 1] * v[j + 1]);
            }
        }
    }
    fout << dp[1][n];
    return 0;
}