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 os

import sys

debug = True

if debug and os.path.exists("input.in"):
    input = open("input.in", "r").readline
else:
    debug = False
    input = sys.stdin.readline


def inp():
    return (int(input()))


def inlt():
    return (list(map(int, input().split())))


def insr():
    s = input()
    return (list(s[:len(s) - 1]))


def invr():
    return (map(int, input().split()))


test_count = 1
if debug:
    test_count = inp()

for t in range(test_count):
    if debug:
        print("Test Case #", t + 1)
    # Start code here
    n = inp()
    A = inlt()
    minH = 1000000
    ans = (1, 2)
    for i in range(n):
        h1 = i
        h2 = i - 1
        h3 = i + 1
        if i == 0:
            h2 = 1
            h3 = n - 1
        elif i == n - 1:
            h2 = n - 2
            h3 = 0
        else:
            pass
        if abs(A[h1] - A[h2]) < minH:
            minH = abs(A[h1] - A[h2])
            ans = (h1, h2)
        if abs(A[h1] - A[h3]) < minH:
            minH = abs(A[h1] - A[h3])
            ans = (h1, h3)
    print(ans[0] + 1, ans[1] + 1)
     