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 height 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 an integer n (2 ≤ n ≤ 100) — the number of soldiers. Then follow the heights of the soldiers in their order in the circle — n space-separated integers a1, a2, ..., a**n (1 ≤ a**i ≤ 1000). The soldier heights are given in a clockwise or counterclockwise direction.

Output

Output two integers — indices of neighbouring soldiers, who should form a reconnaissance unit. If there are many optimal solutions, output any of them. Remember that the soldiers stand in a circle.

Samples

5
10 12 13 15 10

5 1

4
10 20 30 40

1 2