#include <iostream>
#include <vector>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;

    vector<int> M(N);
    for (int i = 0; i < N; i++) {
        cin >> M[i];
    }

    int bestLen = 1;
    int bestStart = 0;

    int start = 0;
    int mn = M[0], mx = M[0];

    for (int i = 1; i < N; i++) {
        mn = min(mn, M[i]);
        mx = max(mx, M[i]);

        if (mx - mn > 1) {
            // új szakasz indul
            start = i - 1;
            mn = min(M[i - 1], M[i]);
            mx = max(M[i - 1], M[i]);
        }

        int len = i - start + 1;
        if (len > bestLen) {
            bestLen = len;
            bestStart = start;
        }
    }

    cout << bestLen + 1 << " " << bestStart << "\n";
    return 0;
}