n soldiers stand in a circle. For each soldier his height ai is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. |ai - aj| is minimal. So each of them will be less noticeable with the other. Output any pair of soldiers that can form a reconnaissance unit.

Input

The first line contains integer n (2 ≤ n ≤ 100) — amount of soldiers. Then follow the heights of the soldiers in their order in the circle — n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000). The soldier heights are given in clockwise or counterclockwise direction.

Output

Output two integers — indexes of neighbouring soldiers, who should form a reconnaissance unit. If there are many optimum solutions, output any of them. Remember, that the soldiers stand in a circle.

Examples

Input

5
10 12 13 15 10


Output

5 1


Input

4
10 20 30 40


Output

1 2
num=int(input())
t=[int(t)for t in input().split()]
l= t[0]-t[num-1]

mini=abs(l)
mini3=mini

s=[]
for i in range (num-1,-1,-1):
    
    m=t[i]-t[i-1]
   
    n=abs(m)
    
    if n<=mini3:
        lsst=[]
        s=0
        bb=0
       
        lsst.append(t[i-1])
        lsst.append(t[i])
       
        mini3 = n
        s=i-1
        bb=i
if mini3 < abs(l):
    print("{0} {1}".format (s+1,bb+1))
  
    
else:
    print("{} 1".format (num))

