#include <cstdio>
#include<algorithm>
#define oo (1 << 31)
#define NMax 505

using namespace std;

int M[NMax][NMax], D[NMax];
int N;

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++)
    {
        M[i][i] = 0;
        M[i][i + 1] = D[i - 1] * D[i] * D[i + 1];
    }
    for(int diff = 2; diff < N; diff++)
        for(int i = 1; i <= N - diff; i++)
        {
            int j = i + diff;
            M[i][j] = oo;
            for(int k = i; k < j; k++)
                M[i][j] = min(M[i][j], M[i][k] + M[k + 1][j] + D[i - 1] * D[k] * D[j]);
        }
    printf("%d\n",M[1][N]);
    return 0;
}