#include <iostream>
#include <fstream>
#include <algorithm>

#define nmax 505
using namespace std;
int n;
int d[nmax*20];
int m[nmax][nmax];

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

int minim(int i,int j)
{
    int minn=199999997;
    for(int k=i;k<=j-1;k++)
        minn=min(minn,m[i][k]+m[k+1][j]+d[i-1]*d[k]*d[j]);
    return minn;
}
void solve()
{
    for(int i=1;i<=n;i++)
        m[i][i]=0;
    for(int p=1;p<=n;p++)
     for(int i=1;i<=n-p;i++)
        m[i][i+p]=minim(i,i+p);
}
int main()
{
    freopen("podm.in","r",stdin);
    freopen("podm.out","w",stdout);
    read();
    solve();
    printf("%d ",m[1][n]);
    return 0;
}