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;
public class Final{
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int[] num = new int[n];
		for(int i = 0; i < n; i++){
			num[i] = in.nextInt();
		}
		int min = 1000000;
		int num1 = 0;
		int num2 = 0; 
		for(int i = 1; i < n; i++){
			if(i == n-1 && Math.abs(num[0] - num[n-1]) < min){
				min = Math.abs(num[0] - num[n-1]);
				num1 = n;
				num2 = 1;
			}
			if(Math.abs(num[i-1] - num[i]) < min){
				min = Math.abs(num[i-1] - num[i]);
				num1 = i;
				num2 = i+1;
			}
		}
		System.out.print(num1 + " " + num2);
	} 
}