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())
a=[]
a=input().split()
for i in range(0,n):
    a[i]=int(a[i])
diff=[]
for i in range(0,n-1):
    if a[i]>=a[i+1]:
        d=a[i]-a[i+1]
    else:
        d=a[i+1]-a[i]
    diff.append(d)
if a[n-1]>=a[0]:
    d=a[n-1]-a[0]
else:
    d=a[0]-a[n-1]
diff.append(d)
min_diff=min(diff)
x=diff.index(min_diff)
if x!=n-1:
    y=x+1
else:
    y=0
x=str(x+1)
y=str(y+1)
print(x+" "+y)