#include<bits/stdc++.h>
#define int long long
#define N 2000005
using namespace std;
int n,a[N],ans,cnt,maxx,tmp;
signed main() {
	freopen("permutrans.in","r",stdin);
	freopen("permutrans.out","w",stdout);
	scanf("%lld",&n);
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
		a[i+n]=a[i];
		if(a[i]>=i)maxx++;
		if(a[i]!=i){
			cnt=1;
		}
	}
	if(cnt==0){
		cout<<n<<' '<<0;
		return 0;
	}
	for(int i=1;i<=n;i++){
		cnt=0;
		ans=0;
		for(int j=i;j<=n;j++){
			cnt++;
			if(a[j]>=cnt)ans++;
		}
		for(int j=n+1;j<=n+i-1;j++){
			cnt++;
			if(a[j-n]>=cnt)ans++;
		}
		if(ans>=maxx){
			maxx=ans;
			tmp=i;
		}
	}
	cout<<maxx<<' '<<n-tmp+1;
	return 0;
}