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
# To change this template, choose Tools | Templates
# and open the template in the editor.
__author__="yaroslav"
__date__ ="$02.08.2011 18:00:13$"

if __name__ == "__main__":
    inp = raw_input()
    #input = inp.rsplit(' ')
    n = int(inp)
    inp = raw_input()
    arr=inp.rsplit(' ')
    arr2 = []
    for i in range(0,n):
        arr2.append(int(arr[i]))

    num1 = n-1
    num2 = 0
    minus = abs(arr2[0]-arr2[n-1])
    for i in range(0,n-1):
        if minus>abs(arr2[i]-arr2[i+1]):
            minus = abs(arr2[i]-arr2[i+1])
            num1 = i
            num2 = i+1

    print str(num1+1)+" "+str(num2+1)