#include<iostream>
using namespace std;
const int N=2e6+6;
int n,a[N];
int l,r; //两个指针 
int f=-1e9,pos;
bool flag;
int main(){
	freopen("permutrans.in","r",stdin);
	freopen("permutrans.out","w",stdout);
	cin.tie(0)->sync_with_stdio(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(a[i]!=i){
			flag=1;
		}
	}
	if(flag==0){
		cout<<n<<" 0"; return 0;
	}
	for(int i=n+1;i<=2*n;i++){
		a[i]=a[i-n];
	}
	l=n+1,r=2*n;
	for(;l>=1;l--,r--){
		int num=0;
		for(int i=l;i<=r;i++){  
			if(a[i]>=i-l+1){
				num++;
			}
		}
		if(num>f){
			f=num,pos=n+1-l;
		}
	}
	cout<<f<<" "<<pos;
return 0;
}