#include <bits/stdc++.h>
using namespace std;
const int N=1000010;
int n,a[N],c[N],sum,s=0,maxx;
int main(){
	freopen("permutrans.in","r",stdin);
	freopen("permutrans.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		if(i>a[i]){
			c[n+a[i]-i+1]++;
		}
		else{
			if(a[i]!=n) c[a[i]-i+1]++;
		}
	}
	for(int i=1;i<=n;i++) if(a[i]>=i) sum++;
	maxx=sum;
	for(int i=1;i<=n;i++){
		if(a[n-i+1]!=n) sum+=1;
		sum-=c[i];
		if(sum>maxx) maxx=sum,s=i;
	}
	printf("%d %d",maxx,s);
	return 0;
}