#include <iostream>
#include <vector>
#include <deque>
using namespace std;
int main()
{
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int>vec(n);
    for (size_t i = 0; i < n; i++) cin >> vec[i];
    deque<int>iq, aq;
    int ms = 0, me = 0, s = 0, e = 0;
    while (e<n)
    {
        int x = vec[e];
        while (!iq.empty() && vec[iq.back()] >= x) iq.pop_back();
        iq.push_back(e);
        while (!aq.empty() && vec[aq.back()] <= x) aq.pop_back();
        aq.push_back(e);

        if (vec[aq.front()] - vec[iq.front()] > 1)
        {
            s++;
            if (s > iq.front()) iq.pop_front();
            if (s > aq.front()) aq.pop_front();
        }
        else
        {
            if (me - ms < e - s)
            {
                me = e;
                ms = s;
            }
            e++;
        }
    }
    cout << me - ms + 1 << " " << ms + 1 << endl;
    return 0;
}