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 arr_inp():
    return [int(x) for x in input().split()]


import math

n = int(input())
a = arr_inp()
min, ix1, ix2 = math.inf, 0, 0

for i in range(n):
    i2 = i + 1
    if (i == n - 1):
        i2 = 0
    diff = abs(a[i] - a[i2])
    if (diff < min):
        ix1, ix2, min = i + 1, i2 + 1, diff

print(ix1, ix2)
