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
import math

n = int(input())
inp=lambda:map(int,input().split())
l=list(inp())
minm = 1000
a, b = 0, 0


# for i in range(n):
for j in range(n):
    # if i==j:
    #     continue
        # else:
    if j == n-1:
        if abs(l[j]-l[0]) < minm:
            a,b = j, 0
            minm = abs(l[0]-l[j])
    elif abs(l[j]-l[j+1]) < minm:
        a,b = j, j+1
        minm = abs(l[j]-l[j+1])
            
    
print(a+1, b+1)
