#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
long long n,dp[501][501],d[501];
int main()
{
    f >> n;
    for(long long i = 0; i<=n; i++)
    {
        f >> d[i];
    }

    for(long long i = 1; i<=n; i++)
    {
        for(long long j = 1; j<=n; j++)
            dp[i][j] = INT_MAX;
    }
    long long dif  = 0;
    long long i,j;
    while(dif!= n)
    {
        i = 1;
        j = i + dif;
        while(j!=n+1)
        {
            if(dif == 0)
                dp[i][j] = 0;
            else
            {
                for(long long x = i; x<=j-1; x++)
                {
                    dp[i][j] = min(dp[i][j],dp[i][x] + dp[x+1][j] + (d[i-1] *d[x] * d[j]));
                }
            }
            i++;
            j++;
        }
        dif++;
    }
    g << dp[1][n];
}