#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
#include <functional>
#include <chrono>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template<typename T> inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;
const double EPS = 1e-9;

const int MAX = 20;
LL N, a[MAX];

LL dp[MAX][2];

int main() {
    cin >> N;
    REP(i, N) {
        cin >> a[i];
    }
    REP(i, N) {
        dp[i][0] = -LLINF;
        dp[i][1] = LLINF;
    }
    dp[0][0] = dp[0][1] = a[0];
    FOR(i, 1, N) {
        chmax(dp[i][0], dp[i - 1][0] + a[i]);
        chmax(dp[i][0], dp[i - 1][1] + a[i]);
        chmax(dp[i][0], dp[i - 1][0] - a[i]);
        chmax(dp[i][0], dp[i - 1][1] - a[i]);
        chmax(dp[i][0], dp[i - 1][0] * a[i]);
        chmax(dp[i][0], dp[i - 1][1] * a[i]);
        if (a[i]) {
            chmax(dp[i][0], dp[i - 1][0] / a[i]);
            chmax(dp[i][0], dp[i - 1][1] / a[i]);
        }
        chmin(dp[i][1], dp[i - 1][0] + a[i]);
        chmin(dp[i][1], dp[i - 1][1] + a[i]);
        chmin(dp[i][1], dp[i - 1][0] - a[i]);
        chmin(dp[i][1], dp[i - 1][1] - a[i]);
        chmin(dp[i][1], dp[i - 1][0] * a[i]);
        chmin(dp[i][1], dp[i - 1][1] * a[i]);
        if (a[i]) {
            chmin(dp[i][1], dp[i - 1][0] / a[i]);
            chmin(dp[i][1], dp[i - 1][1] / a[i]);
        }
    }
    cout << dp[N - 1][0] << endl;
}