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

int consistency1(int n){
	if(n==1) return -INF;
	if(n==2 && a[0]>a[1]) return 1;
	else if(n==2) return -INF;
	
	vector<int> dp(n+1, -INF);
	dp[0] = 0;
	
	dp[1] = -INF;
	if(a[0] > a[1] ) dp[2] = 1; 
	
	for(int i=3; i<=n; i++){
		
		int j = i-2;
		int maxi = a[i-1];
		int maxI = i-1;
		if(a[i-2]>maxi){
			maxi = a[i-2];
			maxI = i-2;
		}
		
		while(j>=0){
			
			if(dp[j] != -INF && maxI != i-1)	dp[i] = max(dp[i], dp[j]+1);
			
			if(j-1>=0){
				if(a[j-1] > maxi){
					maxi = a[j-1];
					maxI = j-1;
				}
			}
			j--;
		}
	}
	
	return dp[n];
}








int consistency2(int n){
	if(n==1) return -INF;
	if(n==2 && a[0]>a[1]) return 1;
	else if(n==2) return -INF;
	
	vector<int> pge(n, -1);
	stack<int> st;
	for(int i=n-1; i>=0; i--){
		while(!st.empty() && a[i] > a[st.top()] ){
			auto top = st.top();	st.pop();
			pge[top] = i;
		}
		st.push(i);
	}
	
	
	vector<int> dp(n+1, -INF);
	vector<int> dpMaxi(n+1, -INF);
	dp[0] = 0;
	dpMaxi[0] = 0;
	
	dp[1] = -INF;
	dpMaxi[1] = max(dpMaxi[0], dp[1]);
	
	if(a[0] > a[1] ) dp[2] = 1; 
	dpMaxi[2] = max(dpMaxi[1], dp[2]);
	
	for(int i=3; i<=n; i++){
		
		int maxi = a[i-1];
		int maxI = i-1;
		if(a[i-2]>maxi){
			maxi = a[i-2];
			maxI = i-2;
		}
		
		int j = pge[i-1];
		if( j!=-1 && dpMaxi[j] != -INF ) 	dp[i] = dpMaxi[j] + 1;
		dpMaxi[i] = max(dpMaxi[i-1], dp[i]);
		
	}
	
	return dp[n];
}















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) << endl;
    // cout << consistency1(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;
}