#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>

using namespace std;

const long long inf = 1e18;

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

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

	vector<vector<long long>> dp(n, {inf, -inf});
	dp[0][0] = dp[0][1] = a[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 + a[i], x - a[i], x * a[i],
		     y + a[i], y - a[i], y * a[i]};
		if (a[i] != 0) {
			tmp.emplace_back(x / a[i]);
			tmp.emplace_back(y / a[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;
}