#include <cstdio>
#include <algorithm>
using namespace std;
int n,v[505];
long long d[505][505];
int main()
{
    freopen("podm.in","r",stdin);
    freopen("podm.out","w",stdout);
    scanf("%d",&n);
    for(int i=0;i<=n;i++)
        scanf("%d",&v[i]);
    for(int l=2;l<=n;l++) {
        for(int i=1;i<=n-l+1;i++) {
            int j=i+l-1;
            d[i][j]=1000000000000;
            for(int k=i;k<=j;k++) {
                d[i][j]=min(d[i][j],d[i][k]+d[k+1][j]+1LL*v[i-1]*v[k]*v[j]);}}}
    printf("%lld",d[1][n]);
    return 0;
}