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 string
n = string.atoi(raw_input())
line = raw_input().split()
soliders = [string.atoi(height) for height in line]
#print soliders
i1 = 0
i2 = 0
min = 1000
for c1 in range(0, n):
    c2 = (c1 + 1) % n
    if(abs(soliders[c1] - soliders[c2]) < min):
        #print str(c1) + '\t' + str(c2) + '\t' + str(abs(soliders[c1] - soliders[c2]))
        i1 = c1
        i2 = c2
        min = abs(soliders[c1] - soliders[c2])
print str(i1 + 1) + ' ' + str(i2 + 1)