#include <iostream>
#include<algorithm>
#include<fstream>
using namespace std;
int n,d[505];
long long a[505][505];
void Citire()
{
    int i,j,k,pas;
    ifstream fin("podm.in");
    fin>>n;
    for(i=0;i<=n;i++)
        fin>>d[i];
    fin.close();

    for(i=1;i<=n-1;i++) a[i][i+1]=d[i-1] * d[i] * d[i+1];
    for(pas=2;pas<= n - 1;pas++)
        for (i=1;i<= n - pas;i++)
        {
            int j = i + pas;
            a[i][j] = 100000000000000000LL;
            for(k=i;k<= j - 1;k++)
                a[i][j] = min(a[i][j], a[i][k] + a[k + 1][j] + 1LL * d[i - 1] * d[k] * d[j]);
        }
    ofstream fout("podm.out");
    fout<<a[1][n]<<"\n";
    fout.close();
}
int main()
{
    Citire();
    return 0;
}