/*
??????
??????
??????
??????
D P ????
??????
??????
??????
??????
??? l l?
??????
??????
?? OI ??
??????
*/
#include<bits/stdc++.h>
using namespace std;
inline int read()
{
   int x=0,f=1;char ch=getchar();
   while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
   while (ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-48;ch=getchar();}
   return x*f;
}
void write(int x)
{
   if(x<0)putchar('-'),x=-x;
   if(x<10)putchar(x+'0');
   else write(x/10),putchar(x%10+'0');
}
const int N=1e1;
const int mod=1e9+7;
//const int mod=998244353;
void T_(){
   int sum=0;
   while(sum<=3e9)sum++;
}
void point(){

}
void clear(){

}
int a[100];
void solve(){
	int n=read(); 
	for(int i=1;i<=n;i++)a[i]=read();
	int minn=a[1];
	int maxn=a[1];
	for(int i=2;i<=n;i++){
		
		maxn=max(maxn*a[i],max(minn*a[i],max(maxn+a[i],maxn-a[i])));
		if(a[i]!=0)maxn=max(maxn,maxn/a[i]);
		minn=min(maxn*a[i],min(minn*a[i],min(minn+a[i],minn-a[i])));
		if(a[i]!=0)minn=min(minn,minn/a[i]);
	}
	cout<<maxn<<"\n";
}
signed main(){
   int T=1;
//   cin>>T;
   while(T--)solve();
   return 0;
}
// ?????????????AC????
// ?????????????????????????
// ??????????????????
// ????????????????????????????????????
// ???????????????????????????????
// ????????????
// ????????????
// ????????????
// ????????????????????
// ????????????????????
// ????????????????????????????????
// ???????????????????????
// ???????????
// ?????????????