#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e8;
const ll INF=1e16;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
	int n;
	cin>>n;
	assert(2<=n&&n<=16);
	vi in(n);
	rep(i,n)cin>>in[i];
	rep(i,n)assert(-9<=in[i]&&in[i]<=9);
	ll dp[2]={in[0],in[0]};
	loop(i,1,n){
		ll ndp[2]={INF,-INF};
		rep(j,2){
			ndp[0]=min(ndp[0],dp[j]+in[i]);
			ndp[0]=min(ndp[0],dp[j]-in[i]);
			ndp[0]=min(ndp[0],dp[j]*in[i]);
			if(in[i])ndp[0]=min(ndp[0],dp[j]/in[i]);

			ndp[1]=max(ndp[1],dp[j]+in[i]);
			ndp[1]=max(ndp[1],dp[j]-in[i]);
			ndp[1]=max(ndp[1],dp[j]*in[i]);
			if(in[i])ndp[1]=max(ndp[1],dp[j]/in[i]);
		}
		dp[0]=ndp[0];dp[1]=ndp[1];
	}
	cout<<dp[1]<<endl;
}