#include <cstdio>
#include <climits>
#include <algorithm>

using namespace std;

long long a[510],d[510][510];
const long long INF = LONG_LONG_MAX;

int main()
{
    int n;
    freopen("podm.in","r",stdin);
    freopen("podm.out","w",stdout);
    scanf("%d",&n);
    for(int i=0;i<=n;i++)
        {
            scanf("%lld",&a[i]);
            d[i][i]=0;
        }
        d[n][n]=0;
    for(int l=2;l<=n;l++)
        for(int i=1;i<=n-l+1;i++)
        {
            int j=i+l-1;
            d[i][j]=INF;
            for(int k=i;k<j;k++)
                d[i][j]=min(d[i][j],d[i][k]+d[k+1][j]+a[i-1]*a[k]*a[j]);
        }
        printf("%lld",d[1][n]);
    return 0;
}