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

template <typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template <typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
using i64 = long long int;

const int INF = INT_MAX, MOD = 1e9 + 7;
const long long LINF = 1e17;
const double EPS = 1e-9, PI = acos(-1);
const int dx[] = {0, 0, 0, -1, 1, -1, 1, 1, -1};
const int dy[] = {0, -1, 1, 0, 0, -1, 1, -1, 1};

int main() {
  ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
  /// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

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

  int N; cin >> N;
  vector<i64> dims(N + 1);
  for (auto &d: dims)
    cin >> d;

  vector<vector<i64>> dp(N + 1);
  for (auto &vec: dp)
    vec.resize(N + 1, 0);
  for (int i = 1; i <= N; i++) {
    dp[i][i] = 0;
    if (i < N)
      dp[i][i + 1] = dims[i - 1] * dims[i] * dims[i + 1];
  }

  for (int d = 2; d < N; d++) {
    for (int i = 1; i <= N - d; i++) {
      dp[i][i + d] = LINF;
      for (int k = i; k < i + d; k++) {
        dp[i][i + d] = min(dp[i][i + d], dp[i][k] + dp[k + 1][i + d] + dims[i - 1] * dims[k] * dims[i + d]);
      }
    }
  }

  cout << dp[1][N] << "\n";
  return 0;
}