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 self() :
    n=int(input())
    a=list(map(int,input().split()))
    s=[]
    s.append(1)
    s.append(2)
    k=abs(a[0]-a[1])
    for i in range(1,len(a)) :
        j=i-1
        if abs(a[i]-a[j])<k :s=[];s.append(i+1);s.append(j+1);k=abs(a[i]-a[j])
    if abs(a[0]-a[-1]) < k:print(1,n);exit()
    print(' '.join(list(map(str,s))))
self()