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
i_m1, i_m2 = 0, 0
n = int(input())
a = [int(x) for x in input().split()]
minn = max(a)
c_a = a
    
for i in range(n):
    s_h = a[i]
    for j in range(n):
        if j == i - 1 or j == i + 1:
            o_s = c_a[j]
            s = max(s_h, o_s) - min(s_h, o_s)
            if s < minn:
                minn = s
                i_m1 = i + 1
                i_m2 = j + 1
                
if max(a[0], a[-1]) - min(a[0], a[-1]) < minn:
    i_m1, i_m2 = 1, n

if i_m1 == 1 and i_m2 == n:
    print(i_m2, i_m1)
else:
    print(i_m1, i_m2)
