# O(N)
from sys import stdin
input=stdin.readline

def solv():
    N=int(input())
    A=list(map(int,input().split()))

    start=0
    length=1

    d={A[0]:1}
    last=0
    for i in range(1,len(A)):
        d[A[i]]=d.get(A[i],0)+1
        while len(d)>2:
            d[A[last]]-=1
            if d[A[last]]==0:
                del d[A[last]]
            last+=1
        AA=list(d.keys())
        if len(AA)==2:
            if abs(AA[0]-AA[1])>1:
                while len(d)>2:
                    d[A[last]]-=1
                    if d[A[last]]==0:
                        del d[A[last]]
                    last+=1
        if i-last+1>length:
            length=i-last+1
            start=last
            
    print(length,start+1)

solv()