#include <iostream>
#include <cstdio>
#include <algorithm>
#define N 505
#define inf (1LL << 63 - 1)

using namespace std;

int n, cost[N];

long long dp[N][N];

void initializare()
{
    for(int i = 1 ; i <= n ; ++i)
    {
        for(int j = 1 ; j <= n ; ++j)
        {
            if(i != j)
            {
                dp[i][j] = inf;
            }
        }
    }

}

void prelucrare()
{
    for(int l = 1 ; l < n ; ++l)
    {
        for(int i = 1 ; i <= (n - l) ; ++i)
        {
            int j = i + l;

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

    printf("%lld", dp[1][n]);
}

void citire()
{
    scanf("%d\n", &n);

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

    initializare();

    prelucrare();
}

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

    citire();

    return 0;
}