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())
arr=list(map(int,input().split()))
m=float("inf")
for i in range(1,n):
    # print(abs(arr[i]-arr[i-1]),i)
    if abs(arr[i]-arr[i-1])<m:
        m=abs(arr[i]-arr[i-1])
        x=i
# print(abs(arr[0]-arr[n-1]))
if abs(arr[x]-arr[x-1])<abs(arr[0]-arr[n-1]):
    print(x,x+1)
else:
    print(1,n)

# n=int(input())
# arr=list(map(int,input().split()))
# m=float("inf")
# for i in range(n):
#     for j in range(i+1,n):
#         print(abs(arr[i]-arr[j]),j+1,i+1)

#         if abs(arr[i]-arr[j])<m:
#             m=abs(arr[i]-arr[j])
#             x=i
#             y=j
# print(y+1,x+1)