#include<iostream>
#include<algorithm>
using namespace std;

int main()
{
	int n, a[20];
	long long dp[20][4];

	cin >> n;

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

	long long add, sub, mul, divi = 0;
	add = a[1] + a[2];
	sub = a[1] - a[2];
	mul = a[1] * a[2];
	if (a[2] != 0) divi = a[1] / a[2];

	dp[1][1] = max(max(add, sub), max(mul, divi));
	dp[1][2] = min(min(add, sub), min(mul, divi));

	for (int i = 1; i < n - 1; i++)
	{
		for (int j = 1; j <= 2; j++)
		{
			divi = 0;
			add = dp[i][j] + a[i + 2];
			sub = dp[i][j] - a[i + 2];
			mul = dp[i][j] * a[i + 2];
			if (a[i + 2] != 0) divi = dp[i][j] / a[i + 2];

			if (j == 1) dp[i + 1][j] = max(max(add, sub), max(mul, divi));
			else dp[i + 1][1] = max(dp[i + 1][1], max(max(add, sub), max(mul, divi)));

			if (j == 1) dp[i + 1][j + 1] = min(min(add, sub), min(mul, divi));
			else dp[i + 1][2] = min(dp[i + 1][2], min(min(add, sub), min(mul, divi)));
		}
	}
	cout << max(dp[n - 1][1], dp[n - 1][2]) << endl;
}