#include <bits/stdc++.h>
using namespace std;
vector<int> st1,st2;
int n;
int qr1(int l, int r) {
    l += n;
    r += n;
    int rt = st1[l];
    while (l && r && l <= r) {
        if (l % 2 == 1) rt = min(rt,st1[l++]);
        if (r % 2 == 0) rt = min(rt,st1[r--]);
        l /= 2;
        r /= 2;
    }
    return rt;
}
int qr2(int l, int r) {
    l += n;
    r += n;
    int rt = st2[l];
    while (l && r && l <= r) {
        if (l % 2 == 1) rt = max(rt,st2[l++]);
        if (r % 2 == 0) rt = max(rt,st2[r--]);
        l /= 2;
        r /= 2;
    }
    return rt;
}
int main() {
    cin >> n;
    vector<int> a(n);
    st1.resize(2*n);
    st2.resize(2*n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        st1[i+n] = a[i];
        st2[i+n] = a[i];
    }
    for (int i = n-1; i >= 0; i--) st1[i] = min(st1[i*2],st1[i*2+1]);
    for (int i = n-1; i >= 0; i--) st2[i] = max(st2[i*2],st2[i*2+1]);
    int l = 1, h = n+1;
    int out = 1;
    while (l+1 < h) {
        int m = (l+h)/2;
        int o = -1;
        for (int i = 0; i <= n-m; i++) {
            int q1 = qr1(i,i+m-1);
            int q2 = qr2(i,i+m-1);
            if (q2-q1 <= 1) {
                o = i;
                break;
            }
        }
        if (o == -1) h = m;
        else {
            l = m;
            out = o+1;
        }
    }
    cout << l << ' ' << out << '\n';
}