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.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;

public class Main {

  public static void main(String[] args) throws IOException {
    Scanner scan = new Scanner(System.in);
    ArrayList<Integer> soldiers = new ArrayList<Integer>();
    Integer number = Integer.parseInt(scan.nextLine());
    for (int i = 0; i < number; i++) {
      Integer n = scan.nextInt();
      soldiers.add(n);
    }
    Integer minDiff = -1;
    Integer index1 = 0;
    Integer index2 = 0;
    for (int i = 0; i < soldiers.size(); i++) {
      if (minDiff == -1) {

        minDiff = Math.abs(soldiers.get(i) - soldiers.get(i + 1));
        index1 = i + 1;
        index2 = i + 2;
      } else if (i == (soldiers.size() - 1)) {
        int temp = Math.abs(soldiers.get(i) - soldiers.get(0));
        if (temp < minDiff) {
          minDiff = temp;
          index1 = i + 1;
          index2 = 0 + 1;
        }
      } else {
        int temp = Math.abs(soldiers.get(i) - soldiers.get(i + 1));
        if (temp < minDiff) {
          minDiff = temp;
          index1 = i + 1;
          index2 = i + 2;
        }
      }
    }
    System.out.println(index1 + " " + index2);

  }
}
								  				 	  	 	 		 			  	