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

n = int(input())
heights = [int(x) for x in input().split()]

soldiers = [x for x in range(1, n + 1)]

heights.append(heights[0])
soldiers.append(soldiers[0])

first_min = 0
second_min = 0
difference_min = 999999999999999999999999

for i in range(len(heights) - 1):
    difference = abs(heights[i] - heights[i+1])
    if difference < difference_min:
        difference_min = difference
        first_min = soldiers[i]
        second_min = soldiers[i+1]

print(first_min, second_min)
