#define inf 1ll<<63-1
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("podm.in");
ofstream fout ("podm.out");
int i,j,k,l,a[502],n;
long long d[502][502];
int main()
{
    fin >> n;
    for (i=0;i<=n;i++)
        fin >>a[i];
    for(l=2;l<=n;l++)
        for (i=1;i<=n-l+1;i++)
        {
            j=i+l-1;
            d[i][j]=inf;
            for(k=i;k<j;k++)
            {
                d[i][j]=min(d[i][j],d[i][k]+d[k+1][j]+1ll*a[i-1]*a[k]*a[j]);
            }
        }
    fout <<d[1][n];
    return 0;
}