#include <iostream>
#include <fstream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
const int maxn = 505;
long long dp[maxn][maxn];
long long v[maxn];
int main()
{
    int n;
    in >> n;
    for(int i = 0; i <= n; i++)
        in >> v[i];
    for(int i = 2; i <= n; i++)
        for(int j = i - 2; j >= 0; j--)
            dp[j][i] = (1LL << 60);
    /*for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            dp[i][j] = v[i]; */
    for(int j = 1; j <= n; j++)
        for(int i = j - 1; i >= 0; i--)
            for(int k = i + 1; k < j; k++)
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j] + v[i] * v[k] * v[j]);
    //for(int i = 1; i <= n; i++)
        //cerr << dp[i][i] << " ";
    out << dp[0][n] << " ";
    return 0;
}