#include<bits/stdc++.h>
using namespace std;
 inline int read(){
    int x = 0,f = 1;
    char ch = getchar();
    while(ch < '0'||ch > '9')
    {
        if(ch == '-')
            f = -1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9')
        x = x * 10 + ch - '0',ch = getchar();
    return x*f;
 }
 int n,pos,tot;
 deque<int> a;
 int main(){
 	freopen("permutrans.in","r",stdin);
 	freopen("permutrans.out","w",stdout);
 	n = read();
 	for(int i = 1;i <= n;i ++){
 		int x;
 		x = read();
 		a.push_back(x);
	 }
 	int maxg = -1;
 	for(int i = 1;i <= n - 1;i ++){
 		int tmp = a.back();
 		a.pop_back();
 		a.push_front(tmp);
 		tot = 0;
 		for(int j = 1;j <= n;j ++){
 			if(a[j] >= j) tot ++;
		 }
		 if(tot > maxg){
		 	maxg = tot;
		 	pos = i;
		 }
		 continue;
	 }
 	cout<<maxg<<" "<<pos-1;
 	return 0;
 }