#include <bits/stdc++.h>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
const int nMax = 503;
const long long inf = (1LL << 60);
int a[nMax];
long long dp[nMax][nMax];
int main()
{
    int n;
    srand(time(0));
    f >> n;
    for(int i = 1; i <= n + 1; i++) {
        f >> a[i];
    }
    for(int i = 1; i < n; i++) {
        dp[i][i + 1] = 1LL * a[i] * a[i + 1] * a[i + 2];
    }
    for(int step = 1; step <= 20; step++) {
        for(int i = 1; i <= n; i++) {
            for(int j = i + 2; j <= n; j++) {
                dp[i][j] = inf;
                for(int k = i; k < j; k++) {
                    dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + 1LL * a[i] * a[k + 1] * a[j + 1]);
                }
            }
        }
    }

    g << dp[1][n] << "\n";
    return 0;
}