#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

const int nmx = 502;
const int inf = 0x3f3f3f3f;

long long n,D[nmx],dp[nmx][nmx];

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

    memset(dp,inf,sizeof(dp));

    scanf("%d", &n);
    for(int i = 0; i <= n; ++i)
        scanf("%lld", &D[i]);

    for(int i = 1; i < n; ++i)
        dp[i][i+1] = D[i-1]*D[i]*D[i+1];

    for(int i = 1; i <= n; ++i)
        dp[i][i] = 0;

    for(int d = 2; d < n; ++d)
        for(int i = 1; i <= n - d; ++i)
            for(int k = i; k < i + d; ++k)
                dp[i][i+d] = min(dp[i][i+d], dp[i][k] + dp[k+1][i+d] + D[i-1]*D[k]*D[i+d]);

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

    return 0;
}