#include #define rep(i,n) for(int i = 0; i < (n); i++) using namespace std; typedef long long ll; int main(){ cin.tie(0); ios::sync_with_stdio(0); int N; cin >> N; vector a(N); rep(i,N) cin >> a[i]; ll ma = a[0], mi = a[0]; rep(i,N) if(i) { ll nt_ma = max({ma + a[i], ma - a[i], ma * a[i], mi + a[i], mi - a[i], mi * a[i]}); ll nt_mi = min({ma + a[i], ma - a[i], ma * a[i], mi + a[i], mi - a[i], mi * a[i]}); if(a[i] != 0) { nt_ma = max({nt_ma, ma / a[i], mi / a[i]}); nt_mi = min({nt_mi, ma / a[i], mi / a[i]}); } tie(ma, mi) = make_pair(nt_ma, nt_mi); } cout << ma << endl; }