#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int N;
    while (cin >> N) {
        vll a(N), ma(N, LLONG_MIN), mi(N, LLONG_MAX);
        rep(i, N)cin >> a[i];
        ma[0] = a[0];
        mi[0] = a[0];
        FOR(i, 1, N) {
            if (a[i] != 0) {
                smax(ma[i], max(ma[i - 1] / a[i], mi[i - 1] / a[i]));
                smin(mi[i], min(ma[i - 1] / a[i], mi[i - 1] / a[i]));
            }
            smax(ma[i], max(ma[i - 1] * a[i], mi[i - 1] * a[i]));
            smin(mi[i], min(ma[i - 1] * a[i], mi[i - 1] * a[i]));
            smax(ma[i], max(ma[i - 1] + a[i], mi[i - 1] + a[i]));
            smin(mi[i], min(ma[i - 1] + a[i], mi[i - 1] + a[i]));
            smax(ma[i], max(ma[i - 1] - a[i], mi[i - 1] - a[i]));
            smin(mi[i], min(ma[i - 1] - a[i], mi[i - 1] - a[i]));
        }
        cout << ma.back() << endl;
    }
}