#include <fstream>
#include <vector>
#include <limits>

using namespace std ;

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

int n ;
long long dp[502][502] ;
vector < long long > a ;

int main()
{

    cin >> n ;

    a.resize (n + 1) ;

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

    for (int i = n - 1 ; i >= 1 ; i --)
    {
        for (int j = i + 1 ; j <= n ; j ++)
        {
            dp[i][j] = INT_MAX ;

            for (int k = i ; k < j ; k ++)
                dp[i][j] = min (dp[i][j], dp[i][k] + dp[k + 1][j] + a[i - 1] * a[j] * a[k]) ;

        }

    }

    cout << dp[1][n] ;

    return 0 ;

}