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.*;
public class Test {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] arr = new int[n+1];
		for (int i=1; i<=n; i++) {
			arr[i] = sc.nextInt();
		}
		int min = Math.abs(arr[1] - arr[2]);
		int[] res = {1,2};
		for (int i=1; i<=n; i++) {
			int d1 = i;
			int d2 = ((d1+1)%n == 0) ? n : (d1+1)%n; 
			int diff = Math.abs(arr[d1] - arr[d2]);
			if (diff < min) {
				min = diff;
				res[0] = d1;
				res[1] = d2;
			}
		}
		System.out.println(res[0] + " " + res[1]);
	}
}
