#include <fstream>
#include <algorithm>

using namespace std;

const int NMAX = 510;
const long long INF = (1LL << 63) - 1;
long long dp[NMAX][NMAX], v[NMAX], n;

int main()
{
    ifstream fin("podm.in");
    ofstream fout("podm.out");
    fin >> n;
    for (int i = 0;i <= n;++i)
        fin >> v[i];
    for (int i = 1;i <= n;++i)
        dp[i][i] = 0;
    for (int i = 1;i < n;++i)
        dp[i][i + 1] = v[i - 1] * v[i] * v[i + 1];
    for (int d = 2;d <= n - 1;++d)
        for (int i = 1;i <= n - d;++i)
        {
            int j = i + d;
            dp[i][j] = INF;
            for (int k = i;k <= j - 1;++k)
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + v[i - 1] * v[k] * v[j]);
        }
    fout << dp[1][n] << "\n";
    fin.close();
    fout.close();
    return 0;
}