#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
ll bpow(ll,ll,ll);
typedef vector<int> vec;
typedef vector<vec> mat;
mat mul(mat &A,mat &B);
mat pow(mat A,ll n);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};


bool cmp_P(const P &a,const P &b){
  return a.second < b.second;
}
vector<ll> a(0);
ll N,m;
ll solve(ll n,ll carry){
  if(n == 0){
    m = max(carry,m);
    return 0;
  }
  else{
    solve(n-1,carry*a[N-n]);
    solve(n-1,carry-a[N-n]);
    solve(n-1,carry+a[N-n]);
    if(a[N-n] != 0)
      solve(n-1,carry/a[N-n]);
  }
}


int main()
{
  ll dp[17][2],d;
  dp[0][0] = 0;
  dp[0][1] = 0;
  
  cin >> N;
  REP(i,N){
    cin >> d;
    a.push_back(d);
  }
  dp[1][0] = a[0];
  dp[1][1] = a[0];
  for(int i=2;i<=N;i++){
    dp[i][0] = max(max(dp[i-1][0]*a[i-1],max(dp[i-1][0]+a[i-1],max(a[i-1] == 0 ? -999999999999LL : (dp[i-1][0]/a[i-1]),dp[i-1][0]-a[i-1]))),max(dp[i-1][1]*a[i-1],max(dp[i-1][1]+a[i-1],max(a[i-1] == 0 ? -99999999999LL : (dp[i-1][1]/a[i-1]),dp[i-1][1]-a[i-1]))));
    dp[i][1] = min(min(dp[i-1][0]*a[i-1],min(dp[i-1][0]+a[i-1],min(a[i-1] == 0 ? 999999999999LL :(dp[i-1][0]/a[i-1]),dp[i-1][0]-a[i-1]))),min(dp[i-1][1]*a[i-1],min(dp[i-1][1]+a[i-1],min(a[i-1] == 0 ? 99999999999LL : (dp[i-1][1]/a[i-1]),dp[i-1][1]-a[i-1]))));
  }
  cout << dp[N][0] << endl;
  return 0;
}