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 Palindrome {
    public static void main(String[] args){
      Scanner in = new Scanner(System.in);
      int a = in.nextInt();
      int count = 9999999;
      int in1 = 0;
      int in2 = 0;
      int min = 0;
      int arr[] = new int[a];
      for(int i = 0; i<a; i++){
        arr[i] = in.nextInt();
      } 
      for(int j=0;j<arr.length;j++){

        if(j==arr.length-1){
            min=Math.abs(arr[j]-arr[0]);
            if(min<count){
            count = min;
            in1 = j+1;
            in2 = 1;
        }
        break;
        }
         min=Math.abs(arr[j]-arr[(j+1)]);
         if(min<count){
            count = min;
            in1 = j+1;
            in2 = j + 2;
         }
         

      }
      System.out.println(in1+" "+in2);
    }
}

                    
                