#include <iostream>
#include <fstream>

using namespace std;
// programare dinamica
//formula: v[i-1]*v[k-1]*v[j]+dp[i][k-1]+dp[k][j];
const int MAX=501;
const long long INF=(1ll)<<60;
long long n, v[MAX],dp[MAX][MAX];
int main()
{
    ifstream cin("podm.in");
    ofstream cout("podm.out");
    cin>>n;

    for(int i=0;i<=n;i++) cin>>v[i];


    for(int col=2;col<=n;col++)
    {
        int i=1,j=col;

        while(j<=n)
        {
            dp[i][j]=INF;
            for(int k=i+1;k<=j;k++)
            {
                long long val=v[i-1]*v[k-1]*v[j]+dp[i][k-1]+dp[k][j];
                if(val<dp[i][j]) dp[i][j]=val;
            }

            ++i;
            ++j;
        }
    }

    cout<<dp[1][n];



    return 0;
}