#include <fstream>
#include <climits>

using namespace std;

unsigned short int n;
unsigned short int d[501];

unsigned long long int best[501][501];
unsigned short int i, j, k, w;

unsigned long long int sol;

int main ()
{
    ifstream fin ("podm.in");
    fin >> n;
    for (i=0; i<=n; i++)
        fin >> d[i];
    fin.close();
    for (i=1; i<=n-1; i++)
        best[i][i+1] = d[i-1] * d[i] * d[i+1];
    for (i=2; i<=n-1; i++)
        for (j=1; j<=n-i; j++)
        {
            k = j + i;
            best[j][k] = ULLONG_MAX;
            for (w=j; w<=k-1; w++)
                best[j][k] = min(best[j][k],best[j][w]+best[w+1][k]+d[j-1]*d[w]*d[k]);
        }
    sol = best[1][n];
    ofstream fout ("podm.out");
    fout << sol;
    fout.close();
    return 0;
}