#include <fstream>

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

const int Nmax = 505;
const long long oo = 100000000000000LL;
int n, M[Nmax];
long long DP[Nmax][Nmax];

void Read()
{
    f>>n;
    for(int i = 0; i <= n; i++) f>>M[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*M[i-1]*M[j]*M[k]);
        }
    }
}

void Print()
{
    g<<DP[1][n];
}

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