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.*;
import java.lang.*;

public class Main {
	Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		new Main().A();
	}
	void A()
	{
		int n = sc.nextInt();
		int[] a = new int[n+1];
		for(int i = 0; i < n; i++) a[i] = sc.nextInt();
		a[n] = a[0];
		int min_v = Math.abs(a[1] - a[0]), min_idx = 0;
		for(int i = 1; i < n; i ++ ) {
			int work = Math.abs(a[i+1] - a[i]);
			if(work < min_v) {
				min_v = work;
				min_idx = i;
			}
		}
		System.out.println("" + (min_idx % n + 1) + " " + ((min_idx + 1) % n + 1));
	}
}
