Reconnaissance 2

2000ms

262144K

Description:

n soldiers stand in a circle. For each soldier his height a_i is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. |a_i - a_j| 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 a₁, a₂, ..., a_n (1 ≤ a_i ≤ 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.

Sample Input:

5
10 12 13 15 10

Sample Output:

5 1

Sample Input:

4
10 20 30 40

Sample Output:

1 2

Informação

Provedor Codeforces

Código CF34A