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(raw_input(""))
s = raw_input("").split()
a = []
for i in range (len(s)):
	a.append( (i+1,int(s[i])) )
min = abs(a[n-1][1]-a[0][1])
if min == 0 :
	print 1 , n
	exit()
ind = -1
for i in range (len(a)-1):
	temp = abs(a[i+1][1] - a[i][1])
	if temp < min :
		min = temp
		ind = i
	if min == 0 :
		print a[i][0] , a[i+1][0]
		exit()	
if ind == -1:
	print n , 1
else:
	print a[ind][0] , a[ind+1][0]		

