#include <cstdio>
using namespace std;

long n,d[1000];
long m[1000][1000];

void read()
{
    scanf("%ld",&n);
    for (int i=0;i<=n;i++)
        scanf("%ld",&d[i]);
}

long minim(int i, int j)
{
    long mins=0;
    long s;
    for (int k=i;k<j;k++)
    {
        s=m[i][k]+m[k+1][j]+(d[i-1]*d[k]*d[j]);
        if (mins>s || mins==0)
        {
            mins=s;
            m[j][i]=k;
        }
    }
    return mins;
}

void solve()
{
    for (int j=1;j<n;j++)
        for (int i=1;i<n;i++)
            m[i][i+j]=minim(i,i+j);
}

void scrie()
{
    for (int i=1;i<=n;i++)
    {
        for (int j=1;j<=n;j++)
            printf("%ld ",m[i][j]);
        printf("\n");
    }
}

void rec(int i,int j)
{

    if (i==j)
        printf("A%d",i);
    else
    {
        printf("(");
        rec(i,m[j][i]);
        printf(" ");
        rec(m[j][i]+1,j);
        printf(")");
    }
}

int main()
{
    freopen("podm.in","r",stdin);
    freopen("podm.out","w",stdout);
    read();
    solve();
    printf("%ld",m[1][n]);
    //rec(1,n);
    //scrie();
    return 0;
}