#include<iostream>
#include<fstream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;

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

int n;
long long d[10000],c[505][505];

inline void Citire()
{
    fin>>n;
    for (int i=0;i<=n;i++)
        fin>>d[i];
}

inline void Rezolva()
{
    long long minim;
    int j;
    for (int i=1;i<=n-1;i++)
        c[i][i+1]=d[i-1]*d[i]*d[i+1];
    for (int pas=3;pas<=n;pas++)
       for (int i=1;i<=n-pas+1;i++)
        {
            minim=100000000000000000LL;
            j=i+pas-1;
            for (int k=i;k<j;k++)
                if (c[i][k]+c[k+1][j]+d[i-1]*d[k]*d[j]<minim)
                    minim=c[i][k]+c[k+1][j]+d[i-1]*d[k]*d[j];
            c[i][j]=minim;
        }
    fout<<c[1][n]<<"\n";
}

int main()
{
    Citire();
    Rezolva();
    return 0;
}