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
n=int(input())
p=input().split()
h=1000
soldat1=0
soldat2=0
s=[]
for i in range(0,len(p)):
    s.append(int(p[i]))
for i in range(len(s)-1):
    if s[i]==s[i+1]:
        h=0
        soldat1=i
        soldat2=i+1
    elif s[i]>s[i+1] and s[i]-s[i+1]<h:
        h=s[i]-s[i+1]
        soldat1=i
        soldat2=i+1
    elif s[i]<s[i+1] and s[i+1]-s[i]<h:
        h=s[i+1]-s[i]
        soldat1=i
        soldat2=i+1     
if s[len(s)-1]==s[0]:
    h=0
    soldat1=len(s)-1
    soldat2=0
elif s[len(s)-1]>s[0] and s[len(s)-1]-s[0]<h:
    h=s[len(s)-1]-s[0]
    soldat1=len(s)-1
    soldat2=0
elif s[0]>s[len(s)-1] and s[0]-s[len(s)-1]<h:
    h=s[0]-s[len(s)-1]
    soldat1=len(s)-1
    soldat2=0
print(soldat1+1,soldat2+1)                  