#include<bits/stdc++.h>
using namespace std;

int n,c[1000005],b,a[100005],maxn=-1,ans;

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(a[i]>=i)c[a[i]-i+1]--,c[n-i+1]++;
		else c[0]--,c[n-i+1]++,c[n]++,c[n-i+1+a[i]]--;
	}
	for(int i=0;i<n;i++)
	   if(i==0)continue;
	   else c[i]+=c[i-1];
	for(int i=0;i<n;i++)c[i]+=n;
	for(int i=0;i<n;i++){
		if(maxn<c[i])maxn=c[i],ans=i;
	}
	cout<<maxn<<" "<<ans;
	return 0;
}