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

 
    public static void main(String[] args) {
       Scanner input = new Scanner(System.in);
    int n =input.nextInt();
    
       int first = 1,last = 2;
    int  [] arr = new int[n];
       for(int i = 0; i < n; ++i){
           arr[i] = input.nextInt();
       }
       
       int one = arr[0],two = arr[1];
       int check = Math.abs(one - two);
       for(int i = 1; i < arr.length; ++i){
           if((i + 1) < arr.length){
               
               if(Math.abs((arr[i] - arr[i+1])) < check){
                   
                   first = i;
                   first +=1;
                   last = i+1;
                   last +=1;
                   check = Math.abs((arr[i] - arr[i+1]));
                  
               }else{
                   if(Math.abs((arr[0] - arr[arr.length -1])) < check){
                        first = 1;
                        last = n;
                        check = Math.abs((arr[0] - arr[arr.length -1]));
                   }
               }
           }
       }
       if(last == n){
           System.out.println(last + " " + first);
           
       }else{
           System.out.println(first + " " + last);
       }
       
}
}