#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

long long dp[502][502];
int a[502];

int main()
{
    int n;
    in>>n;
    for (int i=1;i<=n+1;i++)
        in>>a[i];
    for (int i=n;i>0;i--)
        for (int j=i;j<=n;j++)
            for (int k=i;k<j;k++)
            {
                if (dp[i][j]==0)
                    dp[i][j]=dp[i][k]+dp[k+1][j]+1LL*a[i]*a[k+1]*a[j+1];
                else
                    dp[i][j]=min (dp[i][j],dp[i][k]+dp[k+1][j]+1LL*a[i]*a[k+1]*a[j+1]);
            }
    out<<dp[1][n];
    return 0;
}