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

#ifndef SPX
ifstream fin("podm.in");
ofstream fout("podm.out");
#define cin fin
#define cout fout
#define long long long
#endif

const int N = 502;
const long INF = (1ul << 63) - 1;

int n;
long d[N];
long dp[N][N];

int main() {
  cin >> n;
  for (int i = 0; i <= n; ++i) {
    cin >> d[i];
  }
  for (int len = 2; len <= n; ++len) {
    for (int i = 0; i <= n - len; ++i) {
      int j = i + len - 1;
      dp[i][j] = INF;
      for (int p = i; p <= j; ++p) {
        long mulLeft = p == i ? 0 : d[i] * d[p] * d[p + 1];
        long mulRight = p == j ? 0 : d[p] * d[p + 1] * d[i + len];
        long mulMin = min(mulLeft + d[i] * d[p + 1] * d[i + len],
                          mulRight + d[i] * d[p] * d[i + len]);
        dp[i][j] = min(dp[i][j], mulMin + dp[i][p - 1] + dp[p + 1][j]);
      }
    }
  }
  cout << dp[0][n - 1] << endl;
}