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
# https://codeforces.com/problemset/problem/34/A

n = int(input().strip())
lst = list(map(int, input().strip().split()))
diff = max(lst) - min(lst)
p1 = 0
p2 = 0
for i in range(0, n - 1):
    if (i == 0):
        if (diff >=abs(lst[n - 1] - lst[0])):
            diff = abs(lst[n - 1] - lst[0])
            p1 = n
            p2 = i + 1
        if (diff >=abs(lst[i + 1] - lst[i])):
            diff = abs(lst[i + 1] - lst[i])
            p1 = i + 1
            p2 = i + 2
    elif (diff >=abs(lst[i + 1] - lst[i])):
        diff = abs(lst[i + 1] - lst[i])
        p1 = i + 1
        p2 = i + 2
print(p1, p2)
