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

soliders = list (map( int, raw_input().split() ) )

min_val = math.fabs( soliders[0] - soliders[1] )

min_indexs = [1, 2]

for temp in range(1, N):
    if temp == ( N - 1 ):
        tmp_min_val = math.fabs( soliders[temp] - soliders[0] )

        if tmp_min_val < min_val:
            min_indexs = [ temp + 1, 1 ]
            min_val = tmp_min_val
    else:
        tmp_min_val = math.fabs( soliders[temp] - soliders[temp + 1] )


        if tmp_min_val < min_val:
            min_indexs  =   [ temp + 1, temp + 2 ]
            min_val = tmp_min_val


print " ".join( map(str, min_indexs) )