#include <bits/stdc++.h>

using namespace std;

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

unsigned long long n,i,j,k,v[510],d[510][510];

int main()
{
    f>>n;
    for(i=1;i<=n+1;i++)f>>v[i];

    /// d[i][j] = numar minim de inmultiri scalare de a inmulti matricele de la i la j
    /// d[i][j] = (d[i][k] + d[k+1][j]) + (v[i] * v[k+1] * v[j+1]); alegem minimul dintre astea, unde k ia valori de la i la (j-1) (i<j)

    for(i=1;i<=n;i++)
    {
        d[i][i]=0;
        if(i<n)d[i][i+1]=v[i-1]*v[i]*v[i+1];
    }

    for(i=n;i>=1;i--)
    {
        for(j=i+1;j<=n;j++)
        {
            d[i][j]=100000000000000000LL;
            for(k=i;k<j;k++)
            {
                d[i][j]=min(d[i][j],d[i][k]+d[k+1][j]+v[i]*v[k+1]*v[j+1]);
            }
        }
    }

    g<<d[1][n];
    return 0;
}