#include <iostream>
#include <fstream>
#include <map>
#include <vector>
#include <list>
#include <iterator>
#include <queue>
#include <algorithm>
#include <tuple>

using namespace std;

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

int p[501];
int m[501][501]={0};

int main(){

    int n;
    in >> n;

    for(int i = 0; i <= n; i++)
        in >> p[i];

    for(int l = 2; l <= n; l++){
        for(int i = 1; i <= n - l + 1; i++){

            int j = i + l - 1;
            m[i][j] = ~(1<<31);

            int s;
            for(int k = i; k <= j - 1; k++){
                s = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j];
                if(s < m[i][j]){
                    m[i][j] = s;
                }
            }
        }
    }

    out << m[1][n];
    return 0;
}