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
num = int(raw_input())
line = map(int, str(raw_input()).split())
a = list(line)
b = range(num)
for i in b:
    b.pop(i)
    b.insert(i, abs(a[i] - a[(i-1)]))
c = sorted(b)
indexer = b.index(c[0])
x = line.index(a[indexer])
#if(a[indexer] == a[indexer-1]):
#    y = line.index(a[indexer], x+1)
#else:
#    y = line.index(a[indexer-1])
if(indexer == 0): print num,1
else: print indexer,(indexer+1)
