#include <iostream>
#include <cstdio>

using namespace std;

long n,d[510],a[510][510];

int mini(int x,int y)
{
    if(x<y)
        return x;
    return y;
}

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

        }
    printf("%d",a[1][n]);
    return 0;
}