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
def abs(x):
    if x > 0:
        return x
    else:
        return -x

def main():
    n = int(raw_input().strip())
    L = map(int,raw_input().strip().split())
    tmp1 = abs(L[n - 1] - L[0])
    tmp2 = n - 1
    tmp3 = 0
    for i in range (n - 1):
        if abs(L[i + 1] - L[i]) < tmp1:
            tmp1 = abs(L[i + 1] - L[i])
            tmp2 = i + 1
            tmp3 = i
    print tmp2 + 1,tmp3 + 1
main()
