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
from math import fabs
a = input()
b = [int(x) for x in raw_input().split(" ")]

minn = fabs(b[0]-b[a-1])
min_i_f = a-1
min_i_l = 0  
for i in xrange(0, a-1):
  if (b[i]==b[i+1]):
    minn = 0
    min_i_f = i
    min_i_l = i+1
  next = fabs(b[i]-b[i+1])
  if next < minn:
    minn = next
    min_i_f = i
    min_i_l = i+1
print min_i_f+1, min_i_l+1	
