#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;

//* Maintaining Trick : Pivoting k 

//* Time = O(n^2)	, Space = O(n)

int consistency1(int n){
	
	int ans = 0;
	vector<int> pMaxDif(n, 0);
	
	pMaxDif[1] = a[0] - a[1];
	
	for(int k=2; k<n; k++){
		
		int j = k;
		int i = j-1;
		int maxDif = pMaxDif[j-1];
		while(i>=0){
			maxDif = max(maxDif, a[i] - a[j]);
			i--;
		}
		pMaxDif[j] = maxDif;
		
		int val = pMaxDif[k-1] * a[k];
		
		ans = max(ans, val);
		
	}	
	
	
	return ans;
}



//* Time = O(n) optimized

int consistency2(int n){
	
	int ans = 0;
	vector<int> pMaxDif(n, 0);
	pMaxDif[1] = a[0] - a[1];
	
	int maxi = max(a[0], a[1]);
	
	for(int k=2; k<n; k++){
		
		int j = k;
		pMaxDif[j] = max(pMaxDif[j-1], maxi - a[j] );
		maxi = max(maxi, a[j]);
		
		int val = pMaxDif[k-1] * a[k];
		
		ans = max(ans, val);
		
	}	
	
	
	return ans;
}



//* Time = O(n)  +   Space = O(1)  optimized

int consistency3(int n){
	
	int ans = 0;
	int maxDifSoFar = a[0] - a[1];
	
	int maxi = max(a[0], a[1]);
	
	for(int k=2; k<n; k++){
		
		int maxDiff = maxDifSoFar;
		
		maxDifSoFar = max(maxDifSoFar, maxi - a[k] );
		maxi = max(maxi, a[k]);
		
		int val = maxDiff * a[k];
		
		ans = max(ans, val);
		
	}	
	
	
	return ans;
}



//* Pivot j : prefix && sufix 

int consistency4(int n){
	
	int ans = 0;
	vector<int> sufixMaxi(n+1);
	for(int i=n-1; i>=0; i--){
		sufixMaxi[i] = max(sufixMaxi[i+1], a[i]);
	}
	
	int maxi = a[0];
	
	for(int j=1; j<=n-2; j++){
		
		int rightMaxi = sufixMaxi[j+1];
		
		int val = (maxi - a[j]) * rightMaxi;
		
		maxi = max(maxi, a[j]);
		
		ans = max(ans, val);
		
	}	
	
	
	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) << " " << consistency4(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;
}