Amr has got a large array of size *n*. Amr doesn't like large arrays so he intends to make it smaller.

Amr doesn't care about anything in the array except the beauty of it. The beauty of the array is defined to be the maximum number of times that some number occurs in this array. He wants to choose the smallest subsegment of this array such that the beauty of it will be the same as the original array.

Help Amr by choosing the smallest subsegment possible.
The first line contains one number *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>), the size of the array.

The second line contains *n* integers *a*<sub class="lower-index">*i*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">6</sup>), representing elements of the array.
n=int(input())
mass=list(map(int, input().split()))
Counter=dict()
for i in range(1,max(mass)+1):
    Counter[i]=0
for i in mass:
    Counter[i]+=1
maxnumber=0
for i in range(1,max(mass)):
    if Counter.get(i)!=None and Counter[i]>Counter[i+1]:
        maxnumber=i
    elif Counter.get(i)!=None and Counter[i]==Counter[i+1] and len(mass[(mass.index(i)):(n-1-mass[::-1].index(i))])>=len(mass[(mass.index(i+1)):(n-1-mass[::-1].index(i+1))]):
        maxnumber=i+1
print(mass.index(maxnumber)+1,(n-mass[::-1].index(maxnumber)))