#include <iostream>
using namespace std;
int main()
{
    int n;  cin>>n;
    int a[n+1]; for(int i=0; i<n; i++){cin>>a[i];}
    bool vegev=0; int mini,minind,maxi,maxind; a[n]=-1;
    int j=0; bool siksag=1; int kez,veg,tav=0,vege,kezdet;
    while(!vegev){
        int koz=a[j],kozind=j,k=j; kez=j;
        while(a[k]==a[k+1]){k++;}
        if(k+1==n){veg=k; siksag=0; vegev=1;}
        else if(a[k+1]==a[j]+1){mini=a[j]; minind=j;
            maxi=a[k+1]; maxind=k+1; siksag=1;}
        else if(a[k+1]=a[j]-1){mini=a[k+1]; minind=k+1;
            maxi=a[j]; maxind=j; siksag=1;}
        else{siksag=0; veg=k;}
        while(siksag){
            if(a[k]!=a[k+1]){
                if(k==n-1){siksag=0; veg=k; vegev=1;}
                else if(a[k+1]==maxi){maxind=k+1;}
                else if (a[k+1]==mini){minind=k+1;}
                else if(a[k]-a[k+1]>1 || a[k+1]-a[k]>1){
                    j=k+1; siksag=0; veg=k;}
                else if(a[k+1]==maxi+1){j=maxind; siksag=0; veg=k;}
                else if(a[k+1]==mini-1){j=minind; siksag=0; veg=k;}}
            k++;}
        if(veg-kez>tav){tav=veg-kez; vege=veg; kezdet=kez;}}
    cout<<tav+1<<" "<<kezdet+1;
    return 0;
}