#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

long N;

long DFS(long x, const vector<long> &a, long i) {
  if (i == N) {
    return x;
  }

  if (a[i] > 0) {
     return max(max(DFS(x + a[i], a, i + 1), DFS(x * a[i], a, i + 1)),
	     DFS(x / a[i], a, i + 1));
  }
  if (a[i] < 0) {
    return max(max(DFS(x - a[i], a, i + 1), DFS(x * a[i], a, i + 1)),
	       DFS(x / a[i], a, i + 1));
  }
  return DFS(x + a[i], a, i + 1);
}

int main() {
  cin >> N;

  vector<long> a(N);
  for (long i = 0; i < N; i++) {
    cin >> a[i];
  }

  cout << DFS(a[0], a, 1) << endl;;
  
  return 0;
}