#include <cstdio>
#include <algorithm>
#include <cstring>
#define maxN 502
#define ll long long
using namespace std;
int i, j, n, k;
ll v[maxN], dp[maxN][maxN];
void read()
{
    freopen("podm.in", "r", stdin);
    scanf("%d", &n);
    for (i = 0; i <= n; ++ i)
        scanf("%lld", &v[i]);
}
void solve()
{
    for (i = n; i >= 1; -- i)
        for (j = i; j <= n; ++ j)
    {
        if (j - i == 0)
            dp[i][j] = 0;
        else
            if (j - i == 1)
                dp[i][j] = v[i - 1] * v[i] * v[j] * 1LL;
        else
        {
            k = i;
            dp[i][j] = dp[i][k] + dp[k + 1][j] + v[i - 1] * v[k] * v[j] * 1LL;
            for (k = i + 1; k < j; ++ k)
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + v[i - 1] * v[k] * v[j] * 1LL);
        }
    }
}
void write()
{
    freopen("podm.out", "w", stdout);
    printf("%lld", dp[1][n]);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}