#include <bits/stdc++.h>

using namespace std;

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

    multiset<int> ms;
    int low = 0;
    int best_i = -1;
    int best = -1;

    for (int high = 0; high < n; high++) {
        ms.insert(a[high]);

        while (*ms.rbegin() - *ms.begin() > 1) {
            ms.erase(ms.find(a[low]));
            low++;
        }

        if (high - low + 1 > best) {
            best = high - low + 1;
            best_i = low + 1;
        }
    }

    cout << best << ' ' << best_i << '\n';

    return 0;
}