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

    }
}