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 = list(map(int,input().strip().split()))[:t]
s=max(a)
q=0
e=0
for i in range(0,len(a)):
  m=a[i]
  if(i!=t-1):
    for j in range(i+1,i+2):
        k=abs(m-a[j])
        if(k<s):
            s=k
            q=i
            e=j
if(len(a)>1):
   if(abs(a[0]-a[t-1])<s):
       q=0
       e=t-1
print(q+1,e+1)
