#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
int main(){
  int n;
  cin >> n;
  int a[n];
  FOR(i,0,n){
    cin >> a[i];
  }
  long long mx = a[0], mn = a[0];
  FOR(i,1,n){
    vector<long long> v;
    v.push_back(mx + a[i]);
    v.push_back(mx - a[i]);
    v.push_back(mx * a[i]);
    if(a[i] != 0) v.push_back(mx / a[i]);
    v.push_back(mn + a[i]);
    v.push_back(mn - a[i]);
    v.push_back(mn * a[i]);
    if(a[i] != 0) v.push_back(mn / a[i]);
    sort(v.begin(), v.end());
    mx = v[7];
    mn = v[0];
  }
  cout << mx << endl;
  return 0;
}