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())

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

mindiff = 1000000000000
thingy = [-1, -1]
for i in range(0, N):
    j = i + 1
    if j == N:
        j = 0
    if abs(heights[i] - heights[j]) < mindiff:
        thingy[0] = i + 1
        thingy[1] = j + 1
        mindiff = abs(heights[i] - heights[j])
            
            
print(thingy[0], thingy[1], sep=" ")
        
