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
from math import sqrt
def calc(arr):
    idx = []
    mini = float('inf')
    for i in range(len(arr)-1):
        if abs(arr[i]-arr[i+1]) < mini:
            mini = abs(arr[i]-arr[i+1])
            idx = [i, i+1]
    if abs(arr[0]-arr[-1]) < mini:
        idx = [0, len(arr)-1]
    return ' '.join(str(x+1) for x in idx)
# get inputs
n = int(input())
arr = list(map(int, input().split()))
print(calc(arr))


