#include <fstream>
#include <climits>

using namespace std;

ifstream fin("podm.in");
ofstream fout ("podm.out");

long long dp[505][505], a[505];

int main()
{
    int n;

    fin >> n;

    for(int i = 0; i <= n; i++)
    {
        fin >> a[i];
    }

    for(int i = n; i >= 1; i--)
    {
        for(int j = i+1; j <= n; j++)
        {
            dp[i][j] = LLONG_MAX;

            for(int k = i; k < j; k++)
            {
                long long x = dp[i][k] + dp[k+1][j] + a[i-1]*a[k]*a[j];
                dp[i][j] = min(dp[i][j], x);
            }
        }
    }

    fout << dp[1][n];
}