#include <iostream>
#include <vector>
#include <deque>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n; cin >> n;
    vector<int>nums(n);
    for (int i = 0; i < n; i++)
    {
        int x; cin >> x;
        nums[i] = x;
    }
    int l = 0, r = 0;
    int best_dist = 0;
    int start=0;
    deque<int> maxq, minq;
    while (r < nums.size())
    {
        while (!maxq.empty() and nums[maxq.back()] < nums[r])
            maxq.pop_back();
        while (!minq.empty() and nums[minq.back()] > nums[r])
            minq.pop_back();
        maxq.push_back(r);
        minq.push_back(r);
        while (nums[maxq.front()] - nums[minq.front()] > 1)
        {
            if (maxq.front() == l) maxq.pop_front();
            if (minq.front() == l) minq.pop_front();
            l++;
        }
        if (r - l + 1 > best_dist)
        {
            best_dist = r - l + 1;
            start = l + 1;
        }
        r++;
    }
    cout << best_dist << " " << start;
}