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
# with open("input.txt",'r') as f:
# 	t = int(f.readline().rstrip())
# 	# n = int(f.readline().rstrip())
	# n ,a,b   = int(f.readline().rstrip().split())
# 	# arr = list(map(int,f.readline().rstrip().split()))


def main(N,arr):
	dif = abs(arr[-1]-arr[0])
	left  = 0 
	right = N-1
	for i in range(N-1):
		if abs(arr[i+1]-arr[i])<dif:
			dif = abs(arr[i+1]-arr[i])
			left = i 
			right = i+1
	print(left+1,right+1)
	


N = int(input())
arr = list(map(int,input().split()))
main(N,arr)