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 Without_testcase {
		public static void main(String[] args) {
			Scanner sc=new Scanner(System.in);			
			int n=sc.nextInt();
			int a[]=new int[n];
			for(int i=0;i<n;i++)
				a[i]=sc.nextInt();
			//answer...
			int a1=0,a2=0,min=Integer.MAX_VALUE;
			for(int i=0;i<n-1;i++) {
					if(Math.abs(a[i]-a[i+1])<min)
					{
						min=Math.abs(a[i]-a[i+1]);
						a1=i;
						a2=i+1;
					}
				}
			if(Math.abs(a[0]-a[n-1])<min)
			{
				min=Math.abs(a[0]-a[n-1]);
				a1=0;
				a2=n-1;
			}
			
			System.out.println((a1+1)+" "+(a2+1));
	 }	
}