#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

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

    ll a[n];
    rep(i,n)cin >> a[i];

    ll ma = a[0];
    ll mi = a[0];

    srep(i,1,n){
        ll tmp = max(ma + a[i], ma - a[i]);
        tmp = max(tmp, ma * a[i]);
        tmp = max(tmp, mi * a[i]);
        if(a[i] != 0)tmp = max(tmp, ma / a[i]);
        if(a[i] != 0)tmp = max(tmp, mi / a[i]);
        ma = tmp;

        tmp = min(mi + a[i], mi - a[i]);
        tmp = min(tmp, mi * a[i]);
        tmp = min(tmp, ma * a[i]);
        if(a[i] != 0)tmp = min(tmp, mi / a[i]);
        if(a[i] != 0)tmp = min(tmp, ma / a[i]);
        mi = tmp;
    }

    cout << ma << endl;
    return 0;
}