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.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class Young {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int tab[] = new int[n];
		ArrayList<String> list = new ArrayList<String>();

		for (int i = 0; i < n; i++) {
			tab[i] = sc.nextInt();
		}
		int min = 100000000;
		for (int i = 0; i < tab.length - 1; i++) {

			min = Math.min(
					min,
					Math.min(Math.abs(tab[n - 1] - tab[0]),
							Math.abs(tab[i] - tab[i + 1])));
			

			

		}
		for(int i = 0; i<n-1; i++)
		{
			if (min == Math.abs(tab[i] - tab[i + 1])) {
				list.add((i + 1) + " " + (i + 1 + 1));
		}
		}
		System.out.println(list.size() == 0 ? n + " " + 1 : list.get(0));
	}
}
