#include <stdio.h>
#define INF 1000000000000
#define min(a,b) a>b?b:a

long long D[505][505];
int n,i,j,k,t,d[505];

int main()
{
    freopen("podm.in","r",stdin);
    freopen("podm.out","w",stdout);

    scanf("%d",&n);
    for(i=0; i<=n; ++i)
        scanf("%d",&d[i]);
    for(i=1; i<=n-1; ++i)
        D[i][i+1]=d[i-1]*d[i]*d[i+1];
    for(t=2; t<n; ++t)
        for(i=1; i<=n-t; ++i)
        {
            j=i+t;
            D[i][j]=INF;
            for(k=i; k<j; ++k)
                D[i][j]=min(D[i][j], D[i][k]+D[k+1][j] + d[i-1]*d[k]*d[j]);
        }
    printf("%lld",D[1][n]);
    return 0;
}