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
# https://codeforces.com/problemset/problem/34/A
n = input(  )
def int_line():
    return map(int,raw_input().split())

sldrs = int_line()

mn = 1001
ele = sldrs[0]
k = []
for s in range(1, n):
    if abs(ele - sldrs[s]) < mn:
        mn = abs(ele - sldrs[s])
        k = [s-1, s]
    ele = sldrs[s]

if abs(sldrs[0]- sldrs[n-1]) < mn:
    k = [0, n-1]


print (str(k[0]+1 )+ ' ' +str(k[1]+1))

# k = False
# for idx,itm in enumerate(sldrs):
#     for idx1,itm1 in  enumerate(sldrs):
#         if (itm - itm1) >=0 and abs(itm - itm1) <= mn and idx != idx1:
#             mn = abs(itm - itm1) 
#             k= [idx, idx1]

# print (k)
# temp = sldrs[:]
# temp = sorted(temp)

# k = []
# print (temp , sldrs)
# if abs( temp[0] -  sldrs[n-1] ) <= abs( temp[0] - temp[1] ):
#     k.append(1)
#     k.append(n)
# else:
#     k.append (   sldrs.index(temp[0] )+1)
#     k.append( sldrs.index(temp[1]) + 1 )


# print ( str(k [0] )+ ' ' + str(k[1]))