#include <iostream>

using namespace std;

const int N = 2e2 + 3;

int dp[N][N], a[N];

int main() {
  int n, ans = 0;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i], a[i + n] = a[i];
  }
  for (int len = 2; len <= n; len++) {
    for (int l = 1, r = len; l <= n; l++, r++) {
      for (int mid = l; mid < r; mid++) {
        dp[l][r] = max(dp[l][r], dp[l][mid] + dp[mid + 1][r] + a[l] * a[mid + 1] * a[r + 1]);
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    ans = max(ans, dp[i][i + n - 1]);
  }
  cout << ans;
  return 0;
}