#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <functional>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <vector>
#include <array>
#include <tuple>
#include <utility>
#include <numeric>
#include <iomanip>
#include <cctype>
#include <cmath>
#include <assert.h>
#include <cstdlib>
#include <list>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;

template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {
    return s << "(" << p.first << ", " << p.second << ")";
}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
    s << "[";
    for (int i = 0; i < v.size(); i++) s << (i == 0 ? "" : ", ") << v[i];
    s << "]";
    return s;
}

#define ALL(a) (a).begin(), (a).end()

#define int ll

const int MAX_N = 20;
const int INF = (1LL << 50);

int dp_min[MAX_N],  // 最小化
    dp_max[MAX_N];  // 最大化

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

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

    fill(dp_min, dp_min + n, INF);
    fill(dp_max, dp_max + n, -INF);
    dp_min[0] = dp_max[0] = a[0];

    for (int i = 1; i < n; i++) {
        // +
        dp_min[i] = min(dp_min[i], dp_min[i - 1] + a[i]);
        dp_min[i] = min(dp_min[i], dp_max[i - 1] + a[i]);
        dp_max[i] = max(dp_max[i], dp_min[i - 1] + a[i]);
        dp_max[i] = max(dp_max[i], dp_max[i - 1] + a[i]);
        // -
        dp_min[i] = min(dp_min[i], dp_min[i - 1] - a[i]);
        dp_min[i] = min(dp_min[i], dp_max[i - 1] - a[i]);
        dp_max[i] = max(dp_max[i], dp_min[i - 1] - a[i]);
        dp_max[i] = max(dp_max[i], dp_max[i - 1] - a[i]);
        // *
        dp_min[i] = min(dp_min[i], dp_min[i - 1] * a[i]);
        dp_min[i] = min(dp_min[i], dp_max[i - 1] * a[i]);
        dp_max[i] = max(dp_max[i], dp_min[i - 1] * a[i]);
        dp_max[i] = max(dp_max[i], dp_max[i - 1] * a[i]);
        // /
        if (a[i] == 0) continue;
        dp_min[i] = min(dp_min[i], dp_min[i - 1] / a[i]);
        dp_min[i] = min(dp_min[i], dp_max[i - 1] / a[i]);
        dp_max[i] = max(dp_max[i], dp_min[i - 1] / a[i]);
        dp_max[i] = max(dp_max[i], dp_max[i - 1] / a[i]);
    }
    cout << dp_max[n - 1] << endl;

    return 0;
}