#include <iostream>
#include <algorithm>
#include <cstdio>

using namespace std;

const int NMax = 505;
long long d[NMax];
int N;
long long dp[NMax][NMax];


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

void Dinamica()
{
    for(int i=1; i<N; ++i)
        dp[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;
            dp[i][j] = LONG_LONG_MAX;

            for(int k=i; k<=j-1; ++k)
                dp[i][j] = min(dp[i][j], 1LL * (dp[i][k] + dp[k+1][j] + 1LL * d[i-1] * d[k] * d[j]));
        }
    }

    printf("%d", dp[1][N]);
}

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

    Read();
    Dinamica();
    return 0;
}