#include <bits/stdc++.h>

using namespace std;

int main(){

    int n; cin >> n;
    vector<int> v;
    for (int i = 0; i < n; i++){
        int x; cin >> x; v.push_back(x);
    }

    int i = 0, j = 0, meg = 0, megi = 0;
    multiset<int> s;

    s.insert(v[0]);

    while (i < n && j < n){
        while (*s.rbegin() - *s.begin() <= 1){
            j++;
            s.insert(v[j]);
        }
        if (s.size()-1 > meg){
            meg = s.size()-1; megi = i+1;
        }
        s.erase(s.find(v[i]));
        i++;
    }

    cout << meg << " " <<   megi;

    return 0;
}