#include <iostream>
#include <fstream>
#include <climits>
using namespace std;

ifstream in("podm.in");
ofstream out("podm.out");

unsigned long long d[501];
unsigned long long dp[501][501];

int main() {

    int n;
    in >> n;

    for (int i = 0; i <= n; i++) {
        in >> d[i];
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == j) {
                dp[i][j] = 0;
            } else { 
                dp[i][j] = ULLONG_MAX;
            }
        }
    }

    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++) {
                unsigned long long sol = dp[i][k] + dp[k+1][j] + d[i-1] * d[k] * d[j];

                dp[i][j] = min(dp[i][j], sol);
            }
        }
    }

    out << dp[1][n];

    return 0;
}