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
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
import java.util.Scanner;

/**
 *
 * @author ahmed
 */
public class JavaApplication1 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
       Scanner scan = new Scanner(System.in);
       int n=scan.nextInt();
       int[]array = new int[n];
       int min=100000000;
       int index1=0,index2=0;
              for(int i=0;i<array.length;i++){
                  array[i]= scan.nextInt();
              }
       for(int i=0;i<array.length;i++){
           int diff = Math.abs(array[i]- array[(i+1)%n]);
        //   System.out.println(diff);
           if(diff<min){
               index1=i;
               index2=(i+1)%n;
               min=diff;
           }
       }
       System.out.println(  (index1+1)+" " + (index2+1));
               
    }
}
