#include <algorithm>
#include <fstream>
#include <vector>
#include <limits>
using namespace std;

int main() {
    ifstream fin("podm.in");
    ofstream fout("podm.out");
    
    const int INF = numeric_limits<int>::max();
    int n; fin >> n;
    
    vector<int> S(n+1);
    for (int i = 0; i <= n; ++i)
        fin >> S[i];
    
    vector<vector<int>> dp(n, vector<int>(n, INF));
    for (int i = 0; i < n; ++i) dp[i][i] = 0;
    
    for (int i = n-1; i >= 0; --i)
        for (int j = i+1; j < n; ++j)
            for (int k = i; k < j; ++k)
                dp[i][j] = min(dp[i][j],
                    dp[i][k] + dp[k+1][j] + S[i]*S[k+1]*S[j+1]);
    
    fout << dp[0][n-1] << endl;
    
    return 0;
}