// Source: https://usaco.guide/general/io

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

int main() {
    int n;cin>>n;
    vector<int> v(n);
    array<int, 3> ans;
    ans={0,0,0}; 
    for(int i = 0;i<n;i++){
        cin>>v[i];
    }
    deque<pair<int,int>> dx,dn;
    dx.push_front({v[0],0});
    dn.push_front({v[0],0});
    int j = 0;
    for(int i = 0;i<n;i++){
        if(!dx.empty()&&dx.back().second<i)dx.pop_back();
        if(!dn.empty()&&dn.back().second<i)dn.pop_back();
        while(j<n&&dx.back().first-dn.back().first<2){
            j++;
            if(j==n)break;
            while(!dx.empty()&&dx.front().first<v[j])dx.pop_front();
            while(!dn.empty()&&dn.front().first>v[j])dn.pop_front();
            dx.push_front({v[j],j});
            dn.push_front({v[j],j});
        }
        if(j-i>ans[0]){
            ans={j-i,i+1,j};
            //cout<<i+1<<' '<<j+1<<':'<<mn<<','<<mx<<endl;
        }
    }
    cout<<ans[2]-ans[1]+1<<' '<<ans[1];
}