#include <cstdio>
#include <cstring>

#include <algorithm>

using namespace std;

typedef long long int64;

const int N = 505;
const int INF = 0x3f3f3f3f;

int n;
int64 d[N][N];
int64 v[N];

void init(int n)
{
    memset(d, INF, sizeof(d));
    for (int i = 1; i <= n; ++i)
        d[i][i] = 0;
}

int main()
{
    freopen ("podm.in", "r", stdin);
    freopen ("podm.out", "w", stdout);
    
    scanf("%d", &n);
    for (int i = 1; i <= n + 1; ++i) {
        scanf("%lld", &v[i]);
    }
    init(n);
    for (int D = 1; D < n; ++D)
        for (int i = 1; i + D <= n; ++i) {
            int j = i + D;
            for (int k = i; k < j; ++k) {
                d[i][j] = min(d[i][j], d[i][k] + d[k + 1][j] + v[i] * v[k + 1] * v[j + 1]);
            }
        }

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

    return 0;
}