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

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

	cin >> n;

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

	int 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] = max(max(add, sub), max(mul, divi));

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

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