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())
p=input()
p=list(map(int,p.split()))
m=10000
l,k=0,0
for i in range(1,n-1):
   if m>abs(p[i]-p[i-1]):
       m=abs(p[i]-p[i-1])
       l,k=i,i+1
   if m>abs(p[i]-p[i+1]):
       m=abs(p[i]-p[i+1])
       l,k=i+1,i+2
if m>abs(p[0]-p[n-1]):
    m=abs(p[0]-p[n-1])
    l,k=1,n
if m>abs(p[0]-p[1]):
    m=abs(p[0]-p[1])
    l,k=1,2
if m>abs(p[n-2]-p[n-1]):
    l,k=n-1,n
print(l,k)