#include <stdio.h>
#include <bits/stdc++.h>

#define rep(i, n) for(int i = 0; i < n; i++)
#define repa(i, l, r) for (int i = l; i < r; i++)
#define repd(i, r, l) for (int i = r; i > l; i--)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
ifstream fin ("podm.in");
ofstream fout ("podm.out");
const int Nmax = 511;
ll d[Nmax][Nmax], a[Nmax];
int N;

ll dp(int i, int j) {
  if (d[i][j] == -1) {
    ll mn = 1ll << 62;
    for(int k = i+1; k <= j; k++) {
      ll tmp = dp(i,k-1) + dp(k,j) + a[i]*a[k]*a[j+1];
      if (mn > tmp)
        mn = tmp;
    }
    d[i][j] = mn;
  }
  return d[i][j];
}

int main(void) {
  fin >> N;
  rep(i, N+1) {
    fin >> a[i];
  }

  for(int i = 0; i < N; i++)
    for(int j = i; j < N; j++)
      d[i][j] = -1;

  for(int i = 0; i < N; i++)
    d[i][i] = 0;

  for(int i = 0; i+1 < N; i++) {
    d[i][i+1] = a[i]*a[i+1]*a[i+2];
  }

  fout << dp(0, N-1) << endl;
  return 0;
}