#include<bits/stdc++.h>
using namespace std;
int n,p[1000005],pos[1000005],ans,f;
bool flag=true;
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++){
		cin>>p[i];
		if(p[i]!=i){
			flag=false;
		}
		pos[i]=i;
	}
	if(flag){
		cout<<n<<" 0";
		return 0;
	}
	for(int i=1;i<=n;i++){
		int minn=0;
		for(int j=1;j<=n;j++){
			if(p[pos[j]]>=j){
				minn++;
			}
		}
		if(minn>ans){
			ans=minn;
			f=i-1;
		}
		for(int j=1;j<=n;j++){
			pos[j]--;
			if(pos[j]==0){
				pos[j]=n;
			}
		}
	}
	cout<<ans<<" "<<f;
	return 0;
}