#include <bits/stdc++.h>
using namespace std;

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

long long a[505][505],v[505];
int n;

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

    for(int i=1; i<n; ++i)
        a[i][i+1]=v[i-1]*v[i]*v[i+1];

        for(int w=2; w<=n-1; ++w)

        for(int i=1; i<=n-w; ++i)

        {

            int j=i+w;

            for(int k=i; k<=j-1; ++k)

            {

                if(k==i)

                    a[i][j]=a[i][k] + a[k+1][j] + v[i-1] * v[j] * v[k];

                else

                    a[i][j]=min(a[i][j], a[i][k] + a[k+1][j] + v[i-1] * v[j] * v[k]);

            }
        }
    g<<a[1][n];

    return 0;

}