#include<bits/stdc++.h>
using namespace std;
int ans,cntt;
int a[2234567];
int cnt;
int maxans=-1;
int main(){
    freopen("permutrans.in","r",stdin);
    freopen("permutrans.out","w",stdout);
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
    	cin>>a[i];
    	a[i+n]=a[i];
    	if(a[i]-a[i-1]==1)cnt++;
    }
    if(cnt==n){
    	cout<<n<<" "<<0;
    	return 0;
	}
    for(int i=0;i<n;i++){
    	for(int j=i;j<i+n;j++){
    		if(a[j]>=j-i+1)ans++;
    	}
    	if(maxans<=ans){
    		cntt=n-i;
    		maxans=max(maxans,ans);
    	}
    	ans=0;
    }
    cout<<maxans<<" "<<cntt;
    return 0;
}