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
# http://codeforces.com/problemset/problem/34/A

"""
n soldiers stand in a circle.
Soldier i has height a_i

A reconnaissance unit consists of two neighbouring soldiers whose height
difference is minimal. Output any pair of soldiers that can form a reconnaissance unit
"""

import sys

n = int(sys.stdin.readline())
A = list(map(int, sys.stdin.readline().split()))

# Just have to check the end and start pair

# We know that n is greater than 2 by problem statement
min_dif = abs(A[0]-A[1])
index = 1

for i in range(n):
    if abs(A[i]-A[(i+1) % n]) < min_dif:
        min_dif = abs(A[i]-A[(i+1) % n])  # Update the value otherwise we just reach the terminal condition
        index = i + 1  # Because their index starts from 1

sys.stdout.write(f'{index} {index % n + 1}')
