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
try:
    n=int(input())
    x=list(map(int,input().split(" ")))
    s=abs(x[0]-x[1])
    m=0
    for i in range(1,len(x)):
        if i+1<len(x) and abs(x[i]-x[i+1])<s:
            p=i
            q=i+1
            s=abs(x[i]-x[i+1])
            m=1
    if m==0:
        p=0
        q=1
        
    r=x[len(x)-1]
    t=x[0]
    if abs(r-t)<s:
        p=len(x)-1
        q=0
    print(str(p+1)+" "+str(q+1))
            
    
        
    
except:
    pass