#include <bits/stdc++.h>
 
using namespace std;
 
ifstream fin("permutrans.in");
ofstream fout("permutrans.out");
#define cin fin
#define cout fout
 
const int N = 1e6 + 10;
 
int n, p[N];
int add[N], sub[N];
 
int main()
{
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> p[i];
		if (p[i] >= i)
		{
			add[0]++;
			if (p[i] != n) sub[p[i]-i]++, add[n-i+1]++;
		}
		else add[n-i+1]++, sub[n-i+p[i]]++;
	}
	int cnt = 0, mxcnt = 0, maxi = 0;
	for (int i = 0; i < n; i++)
	{
		cnt += add[i];
		if (cnt > mxcnt) mxcnt = cnt, maxi = i;
		cnt -= sub[i];
	}
	cout << mxcnt << ' ' << maxi;
}