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
n=int(input())
l=[int(i) for i in input().split()]
l1=[]
l2=[]
for i in range(n-1):
    x1=abs(l[i]-l[i-1])
    x2=abs(l[i]-l[i+1])
    if x1<=x2:
        l1.append(x1)
        l2.append(-1)
    else:
        l1.append(x2)
        l2.append(1)
c1=min(l1)
c2=l1.index(c1)
c3=c2+l2[c2]
if c3<0:
    print(str(c2+1)+" "+str(n-1-c3))
else:
    print(str(c2+1)+" "+str(c3+1))

