#include <iostream>
#include <fstream>

using namespace std;

long long INF=1ll<<60;

long long a[505];
long long dp[505][505];

int main()
{
    ifstream in("podm.in");
    ofstream out("podm.out");
    int n;
    in>>n;
    for (int i=1;i<=n+1;i++)
    {
        in>>a[i];
    }
    for (int i=n-1;i>=1;i--)
    {
        for (int j=i+1;j<=n;j++)
        {
            long long minim=INF;
            for (int k=i;k<j;k++)
            {
                if (minim>dp[i][k]+dp[k+1][j]+a[i]*a[k+1]*a[j+1])
                    minim=dp[i][k]+dp[k+1][j]+a[i]*a[k+1]*a[j+1];
            }
            dp[i][j]=minim;
        }
    }
    out<<dp[1][n];
    in.close();
    out.close();
    return 0;
}