#include <bits/stdc++.h>
using namespace std;
int v[501];
long long dp[501][501];
int main(){
    freopen("podm.in", "r", stdin);
    freopen("podm.out", "w", stdout);
    int n;
    scanf("%d",&n);
    for(int i=0;i<=n;++i)
        scanf("%d",&v[i]);
    for(int d=0;d<n;++d)
        for(int i=1;i<=n-d;++i)
            if(d==0)
                dp[i][i]=0;
            else if(d==1)
                dp[i][i+1]=1LL*v[i-1]*v[i]*v[i+1];
            else{
                dp[i][i+d]=LLONG_MAX;
                for(int k=i;k<i+d;++k)
                    dp[i][i+d]=min(dp[i][i+d],dp[i][k]+dp[k+1][i+d]+1LL*v[i-1]*v[k]*v[i+d]);
            }
    printf("%lld\n",dp[1][n]);
    return 0;
}