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
N, X, Min, Index1, Index2 = int(input()), list(map(int, input().split())), 10 ** 4, 0, 0
for i in range(N - 1, -1, -1):
    if abs(X[i] - X[i - 1]) < Min:
        Index1, Index2, Min = i, i + 1, abs(X[i] - X[i - 1])
print(str(N) + " " + str(sorted([Index2, Index1])[1]) if 0 in [Index2, Index1] else str(Index2) + " " + str(Index1))

# UB_CodeForces
# Advice: “Whenever you find yourself on the side of the majority, it is time to pause and reflect.”
# Location: Behind my desk
# Caption: On the right way
# CodeNumber: 547
