#include <iostream>
#include <cstdio>

using namespace std;
int d[550], n;
long long m[550][550];
long long minim=2000000000000000;
long long mij(int i,int j)
{
    long long ma=20000000000000000;
    for(int k=i;k<j;k++)
    {
        ma=min(ma,m[i][k]+m[k+1][j]+d[i-1]*d[k]*d[j]);
    }
    return ma;
}
void completare()
{
    int i,j;
    for(int l=1;l<n;l++)
    {
        i=1;
        j=l+1;
        for(int p=0;p<n-l;p++)
        {
            m[i][j]=mij(i,j);
            minim=min(minim,m[i][j]);
            i++, j++;
        }

    }
}
int main()
{
    freopen("podm.in","r",stdin);
    freopen("podm.out","w",stdout);
    scanf("%d\n", &n);
    scanf("%d", &d[0]);
    for(int i=1;i<=n;i++)
            scanf(" %d", &d[i]);
    completare();
    cout<<m[1][n];
    return 0;
}