#include <cstdio>
#include <algorithm>
#define LL long long
#define N 5

using namespace std;
LL n,i,j,k,L,R,d[N],D[N][N];
int main()
{
    freopen("podm.in","r",stdin);
    freopen("podm.out","w",stdout);
    scanf("%lld",&n);
    for(i=0;i<=n;i++)
        scanf("%lld",&d[i]);
    for(i=1;i<n;i++)
        D[i][i+1]=d[i-1]*d[i]*d[i+1];
    for(k=3;k<=n;k++)
        for(L=1,R=k;R<=n;L++,R++)
        {
            D[L][R]=D[L+1][R]+d[L-1]*d[L]*d[R];
            D[L][R]=min(D[L][R],D[L][R-1]+d[L-1]*d[R-1]*d[R]);

            for(i=L+1,j=L+2;j<R;i++,j++)
                D[L][R]=min(D[L][R],D[L][i]+D[j][R]+d[L-1]*d[i]*d[R]);
        }
    printf("%lld",D[1][n]);
    return 0;
}