#include<cstdio>
#include<algorithm>

using namespace std;

const int NMAX = 500+5;
const int INF = (1LL<<31)-1;

void Read(),Solve(),Print();

int N;
int D[NMAX];
int DP[NMAX][NMAX];

int main()
{
    Read();
    Solve();
    Print();

    return 0;
}

void Read()
{
    int i;

    freopen("podm.in","r",stdin);
    freopen("podm.out","w",stdout);

    scanf("%d",&N);

    for(i = 0; i <= N; i++)
        scanf("%d",&D[i]);
}

void Solve()
{
    int i,j,k,value;

    for(i = 1; i <= N-1; i++)
        DP[i][i+1] = D[i-1] * D[i] * D[i+1];

    for(k = 2; k <= N; k++)
        for(i = 1; i+k <= N; i++)
        {
            value = INF;

            for(j = i; j <= i+k-1; j++)
                value = min(value, DP[i][j] + DP[j+1][i+k] + D[i-1] * D[j] * D[i+k]);

            DP[i][i+k] = value;
        }
}

void Print()
{
    printf("%d\n",DP[1][N]);
}