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 string_list(s, char):
    output_list = []
    intermediator = ""
    for i in range(len(s)):
        if s[i] != char:
            intermediator += s[i]
            if i == len(s) - 1:
                output_list.append(int(intermediator))
        else:
            if intermediator:
                output_list.append(int(intermediator))
                intermediator = ""
    return output_list


def list_string(l, char):
    output_str = ""
    for i in range(len(l) - 1):
        output_str += str(l[i]) + char
    output_str += str(l[len(l) - 1])
    return output_str


def merge_sort(l):
    def merge(l1, l2):
        i, j = 0, 0
        output_list = []
        while i < len(l1) and j < len(l2):
            if l1[i][0] < l2[j][0]:
                output_list.append(l1[i])
                i += 1
            else:
                output_list.append(l2[j])
                j += 1
        if i == len(l1):
            output_list += (l2[j:])
        else:
            output_list += (l1[i:])
        return output_list

    def sorts(l):
        if len(l) < 2:
            return l
        else:
            mid = len(l) // 2
            left = sorts(l[:mid])
            right = sorts(l[mid:])
            return merge(left, right)
    return sorts(l)



def main_function():
        n = int(input())
        l = string_list(input(), " ")
        l = [[l[i], i + 1] for i in range(len(l))]
        l.append(l[0])
        #sorted_l = merge_sort(l)
        difference = 100000
        soldier_1 = l[0]
        inds = [0, 0]
        for i in range(1, len(l)):
            if abs(l[i][0] - soldier_1[0]) < difference:
                difference = abs(l[i][0] - soldier_1[0])
                inds = [soldier_1[1], l[i][1]]
            soldier_1 = l[i]

        return list_string(inds, " ")



print(main_function())

