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

    public static void main(String[]args){
               
          Scanner sc = new Scanner(System.in);
          int N = sc.nextInt();
          int []Q = new int[N+1];
          for (int i = 0; i<N;i++){
              Q[i] = sc.nextInt();
          }
          Q[Q.length-1] = Q[0];
          
          ArrayList <Integer> R = choice(Q);
          int a=0, b=0;
          a = R.get(0) + 1;
          b = R.get(1) + 1;
          
          if (a==Q.length){a = 1;}
          if (b==Q.length){b = 1;}
          System.out.println(a+" "+b);
          
    }
    
    
    public static ArrayList<Integer> choice(int[]A){
        int min = Integer.MAX_VALUE;
        ArrayList<Integer>Q = new ArrayList<Integer>();
        for (int i = 0; i<A.length-1; i++){
            if (Math.abs(A[i] - A[i+1]) < min){Q.removeAll(Q); min = Math.abs(A[i] - A[i+1]); Q.add(i); Q.add(i+1);}
        }       
        return Q;
    }
}
