#include <iostream>
#include <set>

using namespace std;

int main()
{
    int N;
    cin >> N;
    int meresek[100001];
    for(int i = 1; i <= N; i++){
        cin >> meresek[i];
    }

    int maxHossz = 1, maxKezdet = 1, index1 = 1, index2 = 1;
    multiset<int> setSiksag;

    setSiksag.insert(meresek[1]);

    while(index1 <= N && index2 <= N){
        if(*setSiksag.rbegin() - *setSiksag.begin() <= 1){
            index2++;
            setSiksag.insert(meresek[index2]);
        }
        else{
            setSiksag.erase(setSiksag.find(meresek[index1]));
            index1++;
        }

        if(*setSiksag.rbegin() - *setSiksag.begin() <= 1 && maxHossz < index2 - index1 + 1){
            maxHossz = index2 - index1 + 1;
            maxKezdet = index1;
        }
    }
    cout << maxHossz << " " << maxKezdet << endl;
    return 0;
}