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
t=int(input())
a=[int(x) for x in input().split()]
diff=abs(a[0]-a[1])
idx1=0+1
idx2=1+1
for i in range(1,t):
    if(i+1<t and diff>abs(a[i]-a[i+1])):
        diff=abs(a[i]-a[i+1])
        idx1=i+1
        idx2=i+1+1
    if(i+1==t):
        if(abs(a[0]-a[t-1])<diff):
            diff=abs(a[0]-a[t-1])
            idx1=0+1
            idx2=t-1+1
print(idx1,idx2)
