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())
a = list(map(int , input().strip().split()))[:n]   # take input of all the numbers in the circle
b = []

for i in range (n-1) :
	b.append(abs(a[i] - a[i+1]))                  #create a list of height diff between consecutive ppl from 0 to n
	 
b.append(abs(a[0]- a[n-1]))						#diff between height of nth and zeroth person

c= b.index(min(b))
	
if c < n-1:
	first = c+1
	second = c +2
else:
	first = c+1
	second = 1

print (str(first)+ " " + str(second))