// UUID: e5b60cbd-bb1f-48c9-b457-89a1e96b4f81
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
    cin >> n;
    vector<int> h(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> h[i];
    }
    int other = -1, start = 1, same_start = 1, best_start = 1, max_len = 1;
    for (int i = 2; i <= n; i++) {
        if (h[i] != h[i - 1]) {
            if (h[i] == other) {
                other = h[i - 1];
                same_start = i;
            } else if (abs(h[i] - h[i - 1]) == 1) {
                other = h[i - 1];
                start = same_start;
                same_start = i;
            } else {
                start = same_start = i;
                other = -1;
            }
        }
        if (i - start + 1 > max_len) {
            max_len = i - start + 1;
            best_start = start;
        }
    }
    
    cout << max_len << " " << best_start;
}