#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
int P[202020];
int Q[202020];

int hoge(vector<int> V) {
	int C[2]={0,1};
	int i;
	int N=V.size();
	FOR(i,N) {
		if(V[i]>V[C[i%2]]) C[i%2]=i;
	}
	
	if(C[0]<C[1]) {
		return (C[1]-C[0])/2+max(C[0],(N-1-C[1]));
	}
	else {
		return (C[0]-C[1])/2+max(C[1],(N-1-C[0]));
	}
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) cin>>P[i+1];
	/*
	FOR(i,N) P[i+1]=i+1;
	random_shuffle(P+1,P+N+1);
	*/
	if(N==2) {
		cout<<0<<" "<<1<<endl;
		return;
	}
	for(i=1;i<=N;i++) {
		if(P[i-1]<P[i+1]) Q[i+1]=max(Q[i+1],P[i]);
		else Q[i-1]=max(Q[i-1],P[i]);
	}
	int g=0;
	int ma=1;
	vector<int> V;
	FOR(i,N+3) {
		if(Q[i]==0) {
			if(V.size()) {
				g++;
				ma=max(ma,hoge(V)+1);
				V.clear();
			}
		}
		else {
			V.push_back(Q[i]);
		}
	}
	
	cout<<ma<<" "<<g<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}