#include <iostream>
#include <fstream>

using namespace std;

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

typedef long long ll;

const int NMAX = 500 + 10;
const ll INF = (1LL << 62);

int n, d[NMAX];
ll dp[NMAX][NMAX];

int main() {
  in >> n;
  for(int i = 0; i <= n; i++)
    in >> d[i];

  for (int p = 1; p <= n; p++) {
    for (int i = 1; i <= n - p; i++) {
      int j = i + p;
      dp[i][j] = INF;
      for (int k = i; k < j; k++) {
        dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + 1LL * d[i - 1] * d[k] * d[j]);
      }
    }
  }

  out << dp[1][n] << '\n';

  in.close();
  out.close();
  return 0;
}