#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> p(n);
    for (int i = 0; i < n; i++)
        cin >> p[i];

    multiset<int> uj;
    int bal = 0, maxbal = 0, maxhossz = 0;

    for (int i = 0; i < n; i++)
    {
        uj.insert(p[i]);

        while (*uj.rbegin() - *uj.begin() > 1)
        {
            uj.erase(uj.find(p[bal]));
            bal++;
        }

        if ((int)uj.size() > maxhossz)
        {
            maxhossz = uj.size();
            maxbal = bal;
        }
    }

    cout << maxhossz << " " << maxbal + 1;
    return 0;
}