#include<cstdio>

const long long INF = 1000000000000000000LL;

int i,j,n,a[1000],k;
long long v[501][501],u[501][501],pre;
long long minim(long long x ,long long y)
{
    return (x<y) ? x:y;
}
int main()
{

    freopen("pdm.in","r",stdin);
    freopen("pdm.out","w",stdout);
    scanf("%d",&n);
    for(i=1; i<=n+1; ++i)
        scanf("%d",&a[i]);
    for(i=n; i>=1; --i)
    {
        for(j=i+1; j<=n; j++)
        {
            //pre = d[i+1][j] + (long long)a[i]*a[i+1]*a[j+1];
            pre = INF;
            for(k=i; k<j; ++k)
                pre=minim(pre,v[i][k]+v[k+1][j]+a[i]*a[k+1]*a[j+1]);
            v[i][j]=pre;
        }
    }
    printf("%lld",v[1][n]);
}