#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <string>
#include <cmath>
#include <queue>

using namespace std;
using ll=long long;

const ll INF=LLONG_MAX;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

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


    int bottom = nums[0];
    int l = 0;
    vector<int> cnt(100'001, 0);
    vector<int> last(100'001, -1);
    int maxx = 0;
    int max_start = 0;
    for(int r = 1; r < n; r++) {
        cnt[nums[r]]++;
        last[nums[r]] = r;
        if(nums[r] < bottom) {
            while (l <= last[bottom+1]) {
                cnt[nums[l++]]--;
            }
            if(nums[r] < bottom-1) {
                while (l <= last[bottom]) {
                    cnt[nums[l++]]--;
                }
            }
            bottom = nums[r];
        }
        else if(nums[r] > bottom+1) {
            while (l <= last[bottom]) {
                cnt[nums[l++]]--;
            }
            if(nums[r] > bottom+2) {
                while (l <= last[bottom+1]) {
                    cnt[nums[l++]]--;
                }
            }
            bottom = nums[r]-1;
        }
        if(r-l+1 > maxx) {
            maxx = r-l+1;
            max_start = l;
        }
    }
    cout << maxx << " " << max_start+1;
}