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(num1):
    if num1>0:
        return num1
    else:
        return -1*num1
if __name__=='__main__':
    x=int(input())
    list1=input().split(' ')
    list1=[int(a) for a in list1]
    left=list1[-1]
    right=list1[0]
    il=-1
    ir=0
    for i in range(0,len(list1)):
        if mod(list1[i]-list1[i-1])<mod(left-right):
            left=list1[i-1]
            right=list1[i]
            il=i-1
            ir=i
    ir+=1
    if il==-1:
        il=len(list1)
    else:
        il+=1
    print(str(il)," ",str(ir))
        