#include <iostream>
#include <stdio.h>

using namespace std;

int n;
long long d[505];
long long m[505][505];

long long minim(int i, int j)
{
    long long mini = 4000000000000000000;

    for(int k=i; k<j; ++k)
    {
        long long val = m[i][k] + m[k+1][j] + d[i-1]*d[k]*d[j];
        if(mini > val)
            mini = val;
    }

    return mini;
}

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

    scanf("%d\n", &n);

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

    for(int d=1; d<n; ++d)
        for(int i=1; i<=n-d; ++i)
        {
            int j = d+i;
            m[i][j] = minim(i,j);
        }

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

    return 0;
}