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

int N;

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

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

int main() {
  cin >> N;

  vector<int> a(N);
  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }
  cout << DFS(a[0], a, 1) << endl;

  return 0;
}