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 = int(input())
soldier = list(map(int, input().split()))
soldiers = []
for i in range(n):
    soldiers.append([soldier[i],i])
minimum_difference = [abs(soldiers[1][0] - soldiers[0][0]),soldiers[0][1]+1,soldiers[1][1]+1]
for i in range(1,n):
    if minimum_difference[0] > abs(soldiers[i][0] - soldiers[i-1][0]):
        minimum_difference = [abs(soldiers[i][0] - soldiers[i-1][0]),soldiers[i][1]+1,soldiers[i-1][1]+1]
if minimum_difference[0] <= abs(soldier[-1]-soldier[0]):
    print(minimum_difference[1],minimum_difference[2])
else:
    print(1,n)
