#include<cstdio>
#include<algorithm>
using namespace std;
long long d[501],n,i,j,a[501][501],k;
int main ()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%lld",&n);
for(i=0;i<=n;i++)
    scanf("%lld",&d[i]);
for(i=1;i<=n;i++)
    a[i][i]=0;
for(i=1;i<n;i++)
    a[i][i+1]=d[i-1]*d[i]*d[i+1];
for(j=2;j<n;j++)
    {
    for(i=1;i<=n-j;i++)
        {
        long long minim=100000000000000000;
        for(k=i;k<i+j;k++)
            minim=min(minim,a[i][k]+a[k+1][i+j]+d[i-1]*d[k]*d[i+j]);
        a[i][i+j]=minim;
        }
    }
printf("%lld",a[1][n]);
return 0;
}