#include <fstream>

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

const int NMax = 505;
const long long oo = 1000000000000000000LL;

int n, d[NMax];
long long dp[NMax][NMax];

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

void Solve()
{
    for(int step = 1; step < n; step++)
    {
        for(int i = 1; i <= n-step; i++)
        {
            int j = step + i;
            dp[i][j] = oo;
            for(int k = i; k < j; k++)
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + 1LL*d[i-1]*d[j]*d[k]);
        }
    }
}

void Print()
{
    g<<dp[1][n]<<'\n';
}

int main()
{
    Read();
    Solve();
    Print();
    return 0;
}