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
no_soldiers = int(input())
height_soldiers = list(map(int,input().split()))
difference_list = []

for i in range(len(height_soldiers)-1):
    difference = abs(height_soldiers[i] - height_soldiers[i+1])
    difference_list.append(difference)
difference_list.append(abs(height_soldiers[-1]-height_soldiers[0]))
minimal = min(difference_list)

if difference_list.index(minimal)+2 > len(difference_list):   
    print(difference_list.index(minimal)+1,1)
else:
    print(difference_list.index(minimal)+1,difference_list.index(minimal)+2)