#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>

using namespace std;

const long long inf = 1e18;

int main() {
	int n;
	cin >> n;

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

	int limit = 1;
	for (int i = 0; i < n - 1; i++) {
		limit *= 3;
	}

	long long ans = -inf;
	for (int i = 0; i < limit; i++) {
		int tmp = i;
		long long x = a[0];
		for (int j = 1; j < n; j++) {
			int op = tmp % 3;

			switch (op) {
				case 0: x += a[j]; break;
				case 1: x -= a[j]; break;
				case 2: x *= a[j]; break;
				default: break;
			}

			tmp /= 3;
		}

		ans = max(ans, x);
	}
	cout << ans << endl;
	return 0;
}