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
class Code:
    def __init__(self):
        self.n = int(input())
        self.arr = list(map(int, input().split()))

    def process(self):
        arr = []
        for i in range(self.n):
            arr.append([self.arr[i], i + 1])
        arr.append(arr[0])
        mn = abs(arr[0][0] - arr[1][0])
        lis = [arr[0][1], arr[1][1]]
        for i in range(1, self.n):
            if abs(arr[i][0] - arr[i + 1][0]) < mn:
                mn = abs(arr[i][0] - arr[i + 1][0])
                lis = [arr[i][1], arr[i + 1][1]]
        print(lis[0], lis[1])


if __name__ == '__main__':
    code = Code()
    code.process()
