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
import math
n=int(input())
l1=list(map(int,input().split()))
a=l1[0]
l1.append(a)
b=abs(l1[0]-l1[1])
s=s1=0
for i in range(len(l1)-1):
	c=abs(l1[i]-l1[i+1])
	if c<=b:
		s=i+1
		s1=i+2
		b=c
if s==len(l1):
	s=1
if s1==len(l1):
	s1=1
print(s,"",s1)