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
x = input()
x = int(x)
numbers = list(map(int, input().split()))
temp = max(numbers[0] - numbers[1] , numbers[1] - numbers[0])
temp_i = 1
temp_j = 2
for i in range(x):
    y = max(numbers[i] - numbers[(i+1)% x] , numbers[(i+1)% x] - numbers[i])
    if y < temp:
        temp = y
        temp_i = (i % x) + 1
        temp_j = ((i+1) % x) + 1

print(str(temp_i)+' '+str(temp_j))

