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
def q34a():
	n = int(input())
	num_list = [int(num) for num in input().split()]
	num_list.append(num_list[0])
	min_diff = 999999
	min_diff_index = -1
	for i in range(len(num_list) - 1):
		diff = abs(num_list[i+1] - num_list[i])
		if(diff < min_diff):
			min_diff = diff
			min_diff_index = i
	#print(min_diff_index)
	print("%d %d"%(min_diff_index+1, (min_diff_index+1) % (len(num_list)-1) + 1))

q34a()