#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];
    }   


    vector<int> dp1(n);
    vector<int> dp2(n);
    dp1[0] = 1;
    dp2[0] = 1;
    for(int i = 1; i < n; i++) {
        if(nums[i] == nums[i-1]) {
            dp1[i] = dp1[i-1]+1;
            dp2[i] = dp2[i-1]+1;
        } else {
            if(nums[i] == nums[i-1]+1) {
                dp2[i] = dp1[i-1]+1;
                dp1[i] = 1;
            }
            else if(nums[i] == nums[i-1]-1) {
                dp2[i] = 1;
                dp1[i] = dp2[i-1]+1;
            }
            else {
                dp1[i] = 1;
                dp2[i] = 1;
            }
        }
    }
    int maxx = 0;
    int maxx_start = 0;
    for(int i = 0; i < n; i++) {
        if(dp1[i] > maxx) {
            maxx = dp1[i];
            maxx_start = i-maxx+1;
        }
        if(dp2[i] > maxx) {
            maxx = dp2[i];
            maxx_start = i-maxx+1;
        }
    }
    cout << maxx << " " << maxx_start+1;
}