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 java.util.Scanner;
import static java.lang.Math.*;

public class Contest34A {

	public static void main(String[] args) {
		Scanner r = new Scanner(System.in);
		int size = r.nextInt();
		int list[] = new int[size];
		int index1 = 0;
		int index2 = 1;
		int minimal;
		minimal = 999;

		list[0] = r.nextInt();
		for(int i = 1; i < size; i++) {
			list[i] = r.nextInt();
			if(abs(list[i - 1] - list[i]) < minimal){
				index1 = i;
				index2 = i + 1;
				minimal = abs(list[i - 1] - list[i]);
			}
		}
		if(abs(list[size - 1] - list[0]) < minimal){
			index1 = size;
			index2 = 1;
			minimal = abs(list[size - 1] - list[0]);
		}
		System.out.print(index1 + " " + index2);
	}

}
