#include<bits/stdc++.h>
using namespace std;


const long long INF = 1e18;

int main(){
	int n;
	cin >> n;

	vector<int> v(n, 0);
	for(int i=0; i<n; i++){
		cin >> v[i];
	}

	vector<vector<long long>> dp(n, {INF, -INF});
	dp[0][0] = dp[0][1] = v[0];

	for(int i=1; i<n; i++){
		auto x = dp[i-1][0];
		auto y = dp[i-1][1];
		vector<long long> tmp = {
			x+v[i], x-v[i], x*v[i],
			y+v[i], y-v[i], y*v[i]
		};
		
		if(v[i] != 0){
			tmp.emplace_back(x / v[i]);
			tmp.emplace_back(y / v[i]);
		}

		dp[i][0] = *max_element(tmp.begin(), tmp.end());
		dp[i][1] = *min_element(tmp.begin(), tmp.end());
	}

	cout << max(dp.back()[0], dp.back()[1]) << endl;
}