#include<bits/stdc++.h>
using namespace std;
int ans,n,a[1000010],b[1000010],c[1000010];
int main(){
    freopen("permutrans.in","r",stdin);
    freopen("permutrans.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        if(a[i]>=i)
        ans++;
        c[i]=a[i]-i;
    }
    b[0]=ans;
    for(int i=1;i<=n;i++){
        if(c[i]-n+1<0){
            if(c[i]>=0){
                b[c[i]+1]--;
                
            }b[n-i+1]++;
            if(a[i]<i-1&&i!=1)
            b[n-i+a[i]+1]--;
        }
    }
    int maxx1=b[0],maxx2=0;
    for(int i=1;i<=n-1;i++){
        ans+=b[i];
        if(maxx1<ans){
            maxx1=ans;
            maxx2=i;
        } 
}
    cout<<maxx1<<" "<<maxx2<<endl;
    return 0;
}