#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;

int N;
int a[17];
queue<int> q;

int main()
{
	cin >> N;
	for (int i = 0; i < N; i++)
		cin >> a[i];


	ll num = a[0];
	ll sum = num;
		for (int i = 1; i < N; i++) {
				if (num * a[i] > sum) {
					sum = num * a[i];
				}
				else if (num - a[i] > sum) {
					sum = num - a[i];
				}
				else if (num + a[i] > sum) {
					sum = num + a[i];
				}
				else if(num != 0 && num/a[i] > sum){
					sum = num / a[i];
				}
				num = sum;
		}
		cout << sum << endl;

	return	0;
}