#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <random>
#include <assert.h>
using namespace std;

const string file = "podm";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f; 

//#define ONLINE_JUDGE

int main()
{
#ifdef ONLINE_JUDGE
	ostream &fout = cout;
	istream &fin = cin;
#else
	fstream fin(infile.c_str(), ios::in);
	fstream fout(outfile.c_str(), ios::out);
#endif	

    int N;
    fin >> N;
    vector<long long> A(N + 1);
    for(int i = 0; i <= N; i++)
    {
        fin >> A[i];
    }

    vector<vector<long long> > DP(N + 1, vector<long long>(N + 1, 0));

    for(int d = 1; d < N; d++)
    {
        for(int i = 1; i < N - d + 1; i++)
        {
            int j = i + d;
            DP[i][j] = 1LL << 62;
            for(int k = i; k < j; k++)
            {
                DP[i][j] = min(DP[i][j], DP[i][k] + DP[k+1][j] + A[i-1] * A[k] * A[j]);
            }
        }
    }


    fout << DP[1][N] << "\n";

#ifdef ONLINE_JUDGE
#else
    fout.close();
	fin.close();
#endif
}