// UUID: de8c5f18-d411-4adf-a1cc-4f95353a83f1
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
    cin >> n;
    int lo, last_lo = 1, start = 1, best_start = 1, max_len = 1;
    cin >> lo;
    int hi = lo + 1, last_hi = 0;
    for (int i = 2; i <= n; i++) {
        int curr;
        cin >> curr;
        if (curr != lo && curr != hi) {
            if (curr == lo - 1) {
                start = last_hi + 1;
                hi = lo;
                last_hi = max(last_lo, start - 1);
                lo = curr;
            } else if (curr == hi + 1) {
                start = last_lo + 1;
                lo = hi;
                last_lo = max(last_hi, start - 1);
                hi = curr;
            } else {
                lo = curr;
                start = i;
                hi = curr + 1;
                last_hi = i - 1;
            }
        }
        if (curr == lo) last_lo = i;
        if (curr == hi) last_hi = i;
        if (i - start + 1 > max_len) {
            max_len = i - start + 1;
            best_start = start;
        }
    }
    cout << max_len << " " << best_start;
}