#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;
  vector<int> a(n);
  REP (i, n) cin >> a[i];

  vector<vector<long long>> dp(n, vector<long long>(2));
  dp[0][0] = dp[0][1] = a[0];
  for (int i = 1; i < n; i++) {
    vector<long long> v;
    v.push_back(dp[i-1][0] + a[i]);
    v.push_back(dp[i-1][1] + a[i]);
    v.push_back(dp[i-1][0] - a[i]);
    v.push_back(dp[i-1][1] - a[i]);
    v.push_back(dp[i-1][0] * a[i]);
    v.push_back(dp[i-1][1] * a[i]);
    if (a[i]) {
      v.push_back(dp[i-1][0] / a[i]);
      v.push_back(dp[i-1][1] / a[i]);
    }

    dp[i][0] = *min_element(v.begin(), v.end());
    dp[i][1] = *max_element(v.begin(), v.end());
  }
  

  cout << dp[n-1][1] << endl;
  
  return 0;
}