#include<bits/stdc++.h>
#define ll long long
#define N 1000001 
using namespace std;
int n,a[N],maxx,id;
bool flag=true;
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) flag=false;
	}
	if(flag){
		cout<<n<<' '<<0<<endl;
		return 0;
	}
	for(int i=0;i<n;i++){
		int ans=0,cnt=1;
		for(int j=n+1-i;j<=n;j++){
			if(a[j]>=cnt) ans++;
			cnt++;
		}
		for(int j=1;j<=n-i;j++){
			if(a[j]>=cnt) ans++;
			cnt++;
		}
		if(ans>maxx){
			maxx=ans;
			id=i;
		}
	}
	cout<<maxx<<' '<<id<<endl;
	return 0;
}