#include <bits/stdc++.h>

using namespace std;

#define NMAX 505
#define INF (1LL << 62)

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

void read() {
  scanf("%d ", &n);
  for (int i = 0; i <= n; i++)
    scanf("%d ", &d[i]);
}

void solve() {
  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] + d[i - 1] * d[k] * d[j]);
      }
    }
  }
  printf("%lld\n", dp[1][n]);
}

int main() {
  freopen("podm.in", "r", stdin);
  freopen("podm.out", "w", stdout);

  read();
  solve();

  return 0;
}