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
# python 3
"""
"""
from operator import itemgetter


def reconnaissance_2(soldiers_circle_list: list) -> tuple:
    min_dist_int = 2000
    index = -1
    for i in range(len(soldiers_circle_list)-1):
        dist = abs(soldiers_circle_list[i] - soldiers_circle_list[i+1])
        if dist < min_dist_int:
            index = i
            min_dist_int = dist
    if index == 0:
        return len(soldiers_circle_list)-1, 1
    else:
        return index, index+1


if __name__ == "__main__":
    """
    Inside of this is the test. 
    Outside is the API
    """

    n = int(input())
    soldiers = list(map(int, input().split()))
    soldiers_circle = [soldiers[-1]] + soldiers
    # print(soldiers_circle)

    print(*reconnaissance_2(soldiers_circle))
