#include<bits/stdc++.h>
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;

ll Max[16], Min[16];
ll a[16];
int main() {
	int n; scanf("%d", &n);
	rep(i, n) {
		scanf("%lld", &a[i]);
		if (i == 0) {
			Max[i] = Min[i] = a[i];
		}
		else {
			Max[i] = max({ Max[i - 1] + a[i],Max[i - 1] - a[i],Max[i - 1] * a[i],Min[i - 1] + a[i],Min[i - 1] - a[i],Min[i - 1] * a[i] });
			if (a[i])Max[i] = max({ Max[i], Max[i - 1] / a[i],Min[i - 1] / a[i] });
			Min[i] = min({ Max[i - 1] + a[i],Max[i - 1] - a[i],Max[i - 1] * a[i],Min[i - 1] + a[i],Min[i - 1] - a[i],Min[i - 1] * a[i] });
			if (a[i])Min[i] = min({ Min[i],Max[i - 1] / a[i],Min[i - 1] / a[i] });
		}
	}
	printf("%lld\n", Max[n - 1]);
}