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 _0242Reconnaissance2 {

	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		int start=sc.nextInt();
		int prev=start;int curr;int min=1000;int index1=0,index2=0;
		for(int i=2;i<=n;i++) {
			curr=sc.nextInt();
			int diff1 = Math.abs(curr-prev);
			if(diff1<min) {
				min=diff1;
				index1=i-1;
				index2=i;
			}
			prev=curr;
		}
		int diff1=Math.abs(start-prev);
		if(diff1<min) {
			index1=n;
			index2=1;
		}
		
		System.out.println(index1+" "+index2);

	}

}
