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())
s = list(map(int, input().split()))
current = [10e9, 0, 0]
l = [0,0]
for i in range(len(s)):
    pair = [0]*3
    if i == len(s)-1:
        pair[0] = abs(s[i] - s[0])
        pair[1] = i+1
        pair[2] = 1
    else:
        pair[0] = abs(s[i] - s[i+1])
        pair[1] = i + 1
        pair[2] = i + 2
        l = [i+1, i+2]
    #print(pair[0])
    if pair[0] < current[0]:
        current = pair


print('{} {}'.format(current[1], current[2]))