#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#include <deque>
#include <algorithm>
#include <set>
#define Nmax 505
#define INF ((1LL<<62)-1)
#define ll long long
#define MOD 666013
#define fs first
#define sc second

using namespace std;

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

int n;
ll a[Nmax];
ll dp[Nmax][Nmax];

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

    for (int i = 1; i < n; i++) dp[i][i+1]=a[i]*a[i+1]*a[i+2];

    for (int l = 2; l <= n; l++)
        for (int i = 1; i + l <= n; i++)
        {
            int j=i+l;
            dp[i][j]=INF;
            for (int k = i; k < j; k++)
                dp[i][j]=min(dp[i][j], dp[i][k]+dp[k+1][j]+a[i]*a[k+1]*a[j+1]);
        }



    /*for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
            cout << dp[i][j] << " ";
        cout << '\n';
    }*/

    g << dp[1][n];

    return 0;
}