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
def mod(a,b):
    if a-b<0:
        return b-a
    else:
        return a-b
n=int(input())
lst=list(map(int,input().split()))
minn=10000
j=1
mark=[]
for i in range(n):
    if i==n-1:
        j=0
    if mod(lst[i],lst[j])<=minn:
        minn=mod(lst[i],lst[j])
        mark.append([i,j])
    j+=1
if mark[-1][0]+1!=mark[-1][1]+1:
    print(mark[-1][0]+1,mark[-1][1]+1)
else:
    print(mark[-2][0]+1,mark[-2][1]+1)