#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
	long long a[20];
	long long m[20], m1[20];
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	m[0] = a[0], m1[0] = a[0];
	for (int i = 1; i < n; i++) {
		long long b1 = m[i - 1] + a[i];
		long long b2 = m[i - 1] - a[i];
		long long b3 = m[i - 1] * a[i];
		long long b4 = 0;
		if (a[i] != 0) {
			b4 = m[i - 1] / a[i];
		}
		long long b5 = m1[i - 1] + a[i];
		long long b6 = m1[i - 1] - a[i];
		long long b7 = m1[i - 1] * a[i];
		long long b8 = 0;
		if (a[i] != 0) {
			b8 = m1[i - 1] / a[i];
		}
		m[i] = max({ b1,b2,b3,b4,b5,b6,b7,b8 });
		m1[i] = min({ b1,b2,b3,b4,b5,b6,b7,b8 });
		
	}
	cout << m[n - 1] << endl;
}