#include <bits/stdc++.h>

using namespace std;

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

const int nmax = 505;
const long long inf = LLONG_MAX;

int d[nmax];
long long dp[nmax][nmax];

int main()
{
    int n;
    f >> n;
    for (int i = 1; i <= n + 1; ++ i)
        f >> d[i];
    for (int l = 2; l <= n; ++ l)
        for (int i = 1; i + l <= n + 1; ++ i)
        {
            int j = i + l - 1;
            dp[i][j] = inf;
            if (l == 2)
                dp[i][j] = 1LL * d[i] * d[i + 1] *  d[i + 2];
            else
                for (int k = i; k < j; ++ k)
                    dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + 1LL * d[i] * d[k + 1] * d[j + 1]);
        }
    g << dp[1][n];
}