#include <iostream>
#include <fstream>

using namespace std;

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

long long i,k,j,a[555][555],d[555],n,minim;

int main()
{
    in>>n;
    for(i=1;i<=n+1;++i)
        in>>d[i];
    for(i=n;i;--i)
        for(j=i+1;j<=n;++j)
        {
            minim=2000000000;
            for(k=i;k<j;++k)
            {
                if(a[i][k]+a[k+1][j]+d[i]*d[k+1]*d[j+1]<minim)
                    minim=a[i][k]+a[k+1][j]+d[i]*d[k+1]*d[j+1];
            }
            a[i][j]=minim;
        }
    out<<a[1][n];
    return 0;
}