#include <fstream>

using namespace std;

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

const long long INF = 1e15;

int n;

int d[501];

long long dp[501][501];

int main()
{
    f >> n;

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

    for (int i = 1; i <= n; i++)
    {
        dp[i][i] = 0;

        if (i < n)
            dp[i][i + 1] = 1LL * d[i - 1] * d[i] * d[i + 1];
    }

    for (int i = 2; i <= n; i++)
        for (int j = 1; j + i <= n; j++)
        {
            dp[j][j + i] = INF;

            for (int k = j; k < j + i; k++)
                dp[j][j + i] = min(dp[j][j + i], dp[j][k] + dp[k + 1][j + i] + 1LL * d[j - 1] * d[k] * d[j + i]);
        }

    g << dp[1][n] << "\n";

    return 0;
}