#include<iostream>
#include<queue>
using namespace std;
int n,valua=-1e8,w[1000005];
deque <int> q;
inline int read(){
	char ch;
	int x=0,w=1;
	while(ch<'0'||ch>'9'){
		if(ch=='-')w=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		x=x*10+(ch-'0');
		ch=getchar();
	}
	return x*w;
}
int main(){
	freopen("permutrans.in","r",stdin);
	freopen("permutrans.out","w",stdout);
	n=read();
	for(register int i=1;i<=n;i++){
		int a=read();
		q.push_back(a);
	}
	for(register int i=0;i<n;i++){
		int x=q.back();
		q.pop_back();
		q.push_front(x);
		int cnt=0;
		for(register int j=1;j<=n;j++)if(q[j]>=j)cnt++;
		if(cnt>valua)w[cnt]=i;
		valua=max(valua,cnt);
	}
	cout<<valua<<" "<<w[valua];
	return 0;
}