#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 1000005
#define int long long
#define ul unsigned long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,a[N],t[N],sum1[N],sum2[N],ans;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void ud(int x,int k){while(x<=n)t[x]+=k,x+=x&-x;}
int gs(int x){int sum=0;while(x)sum+=t[x],x&=x-1;return sum;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("permutrans.in","r",stdin);freopen("permutrans.out","w",stdout);
	n=read();fo(i,1,n)a[i]=read();
	fo(i,1,n)
	{
		if(a[i]>=i)ud(n+i-a[i],1);
		sum1[i]=gs(i);
	}
	fo(i,1,n)t[i]=0;
	rf(i,n,1)
	{
		ud(max(i-a[i]+1,1),1);
		sum2[i]=gs(i);
	}
	fo(i,1,n)
		if(sum1[n-i]+sum2[n-i+1]>sum1[n-ans]+sum2[n-ans+1])
			ans=i;
	printf("%lld %lld",sum1[n-ans]+sum2[n-ans+1],ans);
	return 0;
}