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
import javafx.util.Pair;

import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class Main
{
    public  static void main(String arg[]){
        // 入力を読み込む
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        List<Integer> humanList = IntStream
                .range(0, N)
                .map(i -> Integer.parseInt(sc.next()))
                .boxed()
                .collect(Collectors.toList());
        //
        int index = IntStream.range(0, N).mapToObj(i ->
                new Pair<>(i,
                        Math.abs(humanList.get((i + 1) % N) - humanList.get(i)))
        ).min(Comparator.comparingInt(Pair::getValue)).orElse(null).getKey();
        System.out.println(String.format("%d %d", index + 1, (index + 1) % N + 1));
    }
}
