#include <bits/stdc++.h>
using namespace std;
ifstream fin ("podm.in");
ofstream fout ("podm.out");
const short Nmax = 505;
long long dp[Nmax][Nmax];
int a[Nmax] , n;
/**
    Solutia : dinamica mixta
    dp[i][j] - numarul minim de inmultiri scalare a
                produsului M(i - 1 , i) * M(i + 1 , i + 2)
                * ... M(j - 1 , j)
    Complexitate O(n ^ 3)
*/

int main()
{
    int j;
    long long mn;
    fin >> n;
    for(int i = 0; i <= n ; i++)
        fin >> a[i];
    /// Initializare
    for(int i = 1 ; i < n ; i++)
        dp[i][i + 1] = a[i - 1] * a[i] * a[i + 1];
    for(int pas = 1 ; pas < n ; pas++)
        for(int i = 1 ; i <= n - pas ; i++)
    {
        j = i + pas;
        mn = (1LL << 60) - 1;
        for(int k = i ; k < j ; k++)
            mn = min(mn , dp[i][k] + dp[k + 1][j] + 1LL * a[i - 1] * a[k] * a[j] );
        dp[i][j] = mn;
    }
    fout << dp[1][n] << "\n";
    fin.close();
    fout.close();
    return 0;
}