#include <bits/stdc++.h>
using namespace std;

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

const int NMAX = 5e2;
const long long INF = (1LL << 60);

int n;
int d[NMAX + 5];
long long  dp[NMAX + 5][NMAX + 5];

int main(){

    fin >> n;
    for(int i = 0 ;i<=n;++i)
        fin >> d[i];
    for(int i = 1;i<=n;++i){
        dp[i][i] = 0;
        for(int j = i + 1;j<=n;++j)
            dp[i][j] = INF;
    }
    for(int step = 1;step < n;++step)
        for(int i = 1;i <= n - step;++i){
            int j = i + step;
            for(int k = i;k < j;++k){
                long long pos = 1LL * dp[i][k] + dp[k + 1][j] + 1LL * d[i - 1] * d[k] * d[j];
                dp[i][j] = min(dp[i][j] , pos);
            }
        }
    fout << dp[1][n];
    return 0;
}