#include <cstdio>
#include <algorithm>

using namespace std;

long long v[512], dp[512][512];

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

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

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            dp[i][j] = 2000000000000000000LL;

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

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

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


    return 0;
}