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
soldiers = int(input())
h = list(map(int, input().split(" ")))

ct1 = 0
ct2 = 1

final_ct = [0, 1]
min_diff = abs(h[0] - h[1])

for i in range(1, len(h)-1):
    diff = abs(h[i] - h[i+1])
    if(diff<min_diff):
        min_diff = diff
        final_ct[0] = i
        final_ct[1] = i+1

round_diff = abs(h[0] - h[-1])

if(round_diff<min_diff):
    final_ct[0] = len(h) - 1
    final_ct[1] = 0

print(str(final_ct[0]+1)+" "+str(final_ct[1]+1))