#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("podm.in");
ofstream fout("podm.out");

long long int n,d[505],dp[505][505]= {0};
int main()
{
    fin>>n;
    n=n+1;
    for(int i=1; i<=n; i++)
    {
        fin>>d[i];
    }

    for(int i=1,j=2; j-i!=n-1; i++,j++)
    {
        dp[i][j]=dp[i][i]+dp[i+1][j]+d[i]*d[j+1]*d[i+1];
        for(int k=i+1; k<=j-1; k++)
        {
            dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+d[i]*d[j+1]*d[k+1]);
        }

        if(j==n-1)
        {
            j=j-i+1;
            i=0;
        }
    }
    fout<<dp[1][n-1];
    return 0;
}