#include <cstdio>
#include <algorithm>

using namespace std;

int v[510];
long long d[510][510];

int main()
{
    freopen("podm.in","r",stdin);
    freopen("podm.out","w",stdout);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n+1;i++) scanf("%d",&v[i]);
    for(int l=1;l<n;l++)
        for(int i=1;i<=n-l;i++)
        {
            int j=i+l;
            if(i+1==j)
            {
                d[i][j]=1LL*v[i]*v[i+1]*v[i+2];
                continue;
            }
            d[i][j]=1e18;
            for(int k=i;k<j;k++)
                d[i][j]=min(d[i][j],d[i][k]+d[k+1][j]+1LL*v[i]*v[k+1]*v[j+1]);
        }
    printf("%lld",d[1][n]);
    return 0;
}