#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

//* Dp + greedy kadane 

int consistency1(int n){

	if(n==1) return a[0];
	
	int z = 0;
	int neg = 0;
	int prod = 1;
	
	for(int i=0; i<n; i++){
	    if(a[i] < 0) neg++;
	    else if(a[i] == 0) z++;
	    prod *= a[i];
	}
	if( !(neg & 1) && z == 0) return prod;
	
	vector<int> prefix(n+1, 1);
	vector<int> pMaxi(n+1, INT32_MIN);
	int maxi = INT32_MIN;
	for(int i=0; i<n; i++){
	    if(a[i] != 0){
	        prefix[i+1] = prefix[i] * a[i];
	        maxi = max(maxi, prefix[i+1]);
	        pMaxi[i+1] = maxi;
	    }
	}
	
	vector<int> sufix(n+1, 1);
	vector<int> sMaxi(n+1, INT32_MIN);
	
	maxi = INT32_MIN;
	for(int i=n-1; i>=0; i--){
	    if(a[i] != 0){
	        sufix[i] = sufix[i+1] * a[i];
	        maxi = max(maxi, sufix[i]);
	        sMaxi[i] = maxi;
	    }
	}
	
	int ans = INT32_MIN;
	for(int i=0; i<n; i++){
	    int left = pMaxi[i];
	    int right = sMaxi[i+1];
	    if(a[i] <= 0){
	        ans = max(ans, max(left, right));
	    }
	}
	
	if(z > 0)   ans = max(ans, 0LL);
	return ans;
	
}
	
	



//* Greedy Kadane

int consistency2(int n){

	int maxi = INT32_MIN;
	int prod = 1;
	
	for(int i=0; i<n; i++){
		prod *= a[i];
		maxi = max(maxi, prod);
		
	    if(prod == 0){
	        prod = 1;
	    }
	}
	
	
	prod = 1;
	for(int i=n-1; i>=0; i--){
		prod *= a[i];
		maxi = max(maxi, prod);
		if(prod == 0){
			prod = 1;
		}
	}
	
	return maxi;
}
	
	
	
	

//* Optimized 1 loop 

int consistency3(int n){

	int maxi1 = INT32_MIN;
	int maxi2 = INT32_MIN;
	int prod1 = 1;
	int prod2 = 1;
	
	int ans = INT32_MIN;
	
	for(int i=0; i<n; i++){
		prod1 *= a[i];
		prod2 *= a[n-i-1];
		
		maxi1 = max(maxi1, prod1);
		maxi2 = max(maxi2, prod2);
		
		ans = max(ans, max(maxi1, maxi2));
		
	    if(prod1 == 0){
	        prod1 = 1;
	    }
	    if(prod2 == 0){
	    	prod2 = 1;
	    }
	}
	
	
	return ans;
}

















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency1(n) << " " << consistency2(n) << " " << consistency3(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}