#include<stdio.h>
#include<algorithm>
using namespace std;
int n,d[510];
long long s[510][510];
int main()
{
    freopen("podm.in","r",stdin);
    freopen("podm.out","w",stdout);
    scanf("%d",&n);
    for(int i=0;i<=n;++i)
    {
        scanf("%d",&d[i]);
    }
    for(int i=1;i<=n-1;++i)
        s[i][i+1]=1LL*d[i-1]*d[i]*d[i+1];

    for(int j=2;j<=n-1;++j)
        for(int i=1;i<=n-j;++i)
        {
            long long mi=s[i][i]+s[i+1][i+j]+1LL*d[i-1]*d[i]*d[i+j];
            for(int k=i+1;k<i+j;++k)
            {
                if(s[i][k]+s[k+1][i+j]+1LL*d[i-1]*d[k]*d[i+j]<mi)
                    mi=s[i][k]+s[k+1][i+j]+1LL*d[i-1]*d[k]*d[i+j];
            }
            s[i][i+j]=mi;
        }
    printf("%lld",s[1][n]);
    return 0;
}