# O(N*log^2)
from sys import stdin
input=stdin.readline

class minSegmentTree:
    def __init__(self):
        self.tree = None

    def buildTree(self,List):
        n = len(List)
        self.tree = [0 for i in range(2*n)]

        for i in range(n):
            self.tree[i+n] = List[i]

        for i in range(n-1,0,-1):
            self.tree[i] = min(self.tree[i<<1] , self.tree[i<<1 | 1])

    def minInRange(self, left, right):
        n = len(self.tree)//2
        result = self.tree[n+left]
        left += n
        right += n

        while left<right:
            if left&1:
                result = min(result,self.tree[left])
                left += 1
            if right&1:
                right -= 1
                result = min(result,self.tree[right])

            left >>= 1
            right >>= 1

        return result

class maxSegmentTree:
    def __init__(self):
        self.tree = None

    def buildTree(self,List):
        n = len(List)
        self.tree = [0 for i in range(2*n)]

        for i in range(n):
            self.tree[i+n] = List[i]

        for i in range(n-1,0,-1):
            self.tree[i] = max(self.tree[i<<1] , self.tree[i<<1 | 1])

    def maxInRange(self, left, right):
        n = len(self.tree)//2
        result = self.tree[n+left]
        left += n
        right += n

        while left<right:
            if left&1:
                result = max(result,self.tree[left])
                left += 1
            if right&1:
                right -= 1
                result = max(result,self.tree[right])

            left >>= 1
            right >>= 1

        return result

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

    minTree=minSegmentTree()
    minTree.buildTree(A)
    maxTree=maxSegmentTree()
    maxTree.buildTree(A)

    start=0
    length=1

    for i in range(1,len(A)):
        if maxTree.maxInRange(0,i+1)-minTree.minInRange(0,i+1) <= 1:
            if i+1>length:
                start=0
                length=i+1
        else:
            lo=0
            hi=i
            while hi-lo>1:
                mid=(hi+lo)//2
                if maxTree.maxInRange(mid,i+1)-minTree.minInRange(mid,i+1)<=1:
                    hi=mid
                else:
                    lo=mid
            if i+1-hi>length:
                start=hi
                length=i+1-hi
                  
    print(length,start+1)

solv()