#include <iostream>
using namespace std;
const int N = 1e6 + 6;
int a[2 * N];
int n;
int s(int x) {
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        if (a[i + x] >= i) ans++;
    }
    return ans;
}
int main() {
    freopen("permutrans.in", "r", stdin);
    freopen("permutrans.out", "w", stdout);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i + n] = a[i];
    }
    int ans1 = 0, ans2 = 0;
    for (int i = 0; i <= n - 2; i++) {
        int now = s(n - i);
        if (now > ans2) {
            ans1 = i;
            ans2 = now;
        }
    }
    cout << ans2 << " " << ans1;
    return 0;
}