#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <limits>

using namespace std;

const auto INF = std::numeric_limits<unsigned long long>::max();

unsigned long long solve_podm(int n, const vector<int>& d) {
    
    vector<vector<unsigned long long>> dp(n + 1, vector<unsigned long long> (n + 1, INF));

    for (int i = 1; i <= n; ++i)
        dp[i][i] = 0ULL;
    for (int i = 1; i < n; ++i)
        dp[i][i + 1] = 1ULL * d[i - 1] * d[i] * d[i + 1];
    for (int len = 2; len <= n; ++len) {
        for (int i = 1; i + len - 1 <= n; ++i) {
            int j = i + len - 1;
            for (int k = i; k < j; ++k) {
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + 1ULL * d[i - 1] * d[k] * d[j]);
            }
        }
    }
    return dp[1][n];
}

int main()
{
    ifstream fin("podm.in");
    ofstream fout("podm.out");

    int n;

    fin >> n;

    vector<int> dim(n+1);
    for (int i = 0; i <= n; ++i) 
        fin >> dim[i];
    
    fout << solve_podm(n, dim);
    return 0;
}