#include<bits/stdc++.h>
using namespace std;
int k,n,p[1000005],o,total,maxn=-1;
void zhuan(){
	int t=1,num=n;
	int o=p[n];
	for(int i=n;i>1;i--){//hehe++;
		p[i]=p[i-1];
	}
	p[1]=o;
	return ;
}
int main(){
	freopen("permutrans.in","r",stdin);
	freopen("permutrans.out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		if(p[i]!=i)o=1;
		cin>>p[i];
	}
	

	if(!o){
		cout<<n<<" "<<0;
    	return 0;
	}
	for(int i=1;i<=n;i++){
		zhuan();
		total=0;
		for(int j=1;j<=n;j++){//hehe++;
			if(p[j]>=j)total++;
		}
		if(total>maxn)maxn=total,k=i;
	}
	cout<<maxn<<" "<<k;
	//cout<<"\n"<<hehe;
	
	return 0;
}