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 = input().split()
c = 1000
ans = [0,0]

for x in range(n):
    for y in [x+1,x-1]:
        if x != n-1 and x != 0:
            if abs(int(l[x]) - int(l[y])) < c:
                c = abs(int(l[x]) - int(l[y]))
                ans[0] = x+1
                ans[1] = y+1

if abs(int(l[0]) - int(l[n-1])) < c:
    c = abs(int(l[0]) - int(l[n-1]))
    ans[0] = 1
    ans[1] = n
    
print(ans[0], ans[1])
