#include <bits/stdc++.h>

using namespace std;

#define ll long long

ll a[510][510];
ll v[510];
ll n,i,k,mn,j;

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

    scanf("%lld",&n);
    for (i=1;i<=n+1;i++)
        scanf("%lld",&v[i]);

    for (k=1;k<n;k++){
        for (i=1;i<=n-k;i++){
            mn=LLONG_MAX;
            for (j=1;j<=k;j++){
                mn=min(mn,a[i][i+j-1]+a[i+j][i+k]+v[i]*v[i+j]*v[i+k+1]);
            }
            a[i][i+k]=mn;
        }
    }
    printf("%lld",a[1][n]);
    return 0;
}