#include <fstream>
#include <algorithm>

using namespace std;

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

long long int d[505];
long long int m[505][505];

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

    for(int i = 1; i <= n; i++) {
        m[i][i] = 0;
    }

    for(int i = 1; i <= n-1; i++) {
        m[i][i+1] = d[i-1]*d[i]*d[i+1];
    }

    for(int l = 2; l < n; l++)
        for(int i = 1; i <= n-l; i++) {
            m[i][i+l] = 100000000000000000LL;
            for(int k = i; k < i+l; k++) {
                m[i][i+l] = min(m[i][i+l], m[i][k] + m[k+1][i+l] + d[i-1]*d[k]*d[i+l]);
            }
        }

    cout << m[1][n];
}