#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
const int NMax = 500;
const long long oo = 1LL << 60;
int N;
int D[NMax + 5];
long long DP[NMax + 5][NMax + 5];

void Read()
{
    fin >> N;
    for(int i = 0; i <= N; ++i)
        fin >> D[i];
}

void Solve()
{
    for(int i = 1; i <= N; ++i)
        DP[i][i] = 0;
    for(int step = 1; step < N; ++step)
    {
        for(int i = 1; i <= N - step; ++i)
        {
            int j = i + step;
            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[k]*D[j]);
        }
    }
}

void Print()
{
    fout << DP[1][N] << "\n";
}

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