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

int main() {
    int n;
    cin >> n;
    vector<int> m(n + 1); 

    for (int i = 1; i <= n; i++) {
        cin >> m[i];
    }

    int max_length = 0; 
    int max_start_index = 1; 
    int current_length = 1; 
    int current_start_index = 1; 

    for (int i = 2; i <= n; i++) {
        if (abs(m[i] - m[i - 1]) <= 1) {
            current_length++; 
        } else {
         
            if (current_length > max_length) {
                max_length = current_length;
                max_start_index = current_start_index; 
            }
           
            current_length = 1; 
            current_start_index = i; 
        }
    }

    
    if (current_length > max_length) {
        max_length = current_length;
        max_start_index = current_start_index;
    }
    cout << max_length << " " << max_start_index << endl;

    return 0;
}