#include <cstdio>
#include <iostream>

using namespace std;

const int N = 1000010;

int n;
int nums[N];
int magic[2 * N];
int id;
int maxn = -1;

int main () {

	freopen ("permutrans.in", "r", stdin);
	freopen ("permutrans.out", "w", stdout);

	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> nums[i];
	}

	for (int i = 1; i <= n; i++) {
		int numSame = (nums[i] - i + n) % n;
		int numFirst = (1 - i + n) % n;
		// cout << numFirst << ' ' << numSame << endl;
		if (numFirst > numSame) {
			numSame += n;
		}
		magic[numFirst]++;
		magic[numSame + 1]--;
	}

	for (int i = 1; i < 2 * n; i++) {
		magic[i] += magic[i - 1];
	}
	for (int i = 0; i < n; i++) {
		magic[i] += magic[i + n];
		if (magic[i] > maxn) {
			maxn = magic[i];
			id = i;
		}
	}
	cout << maxn << ' ' << id << endl;
	
	return 0;
}