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