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.Scanner;

public class RestoringPassword {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner s = new Scanner(System.in);
        
        int k = s.nextInt();
        int[] mas = new  int[k];
        int[] res = new int[k];
        for (int i = 0; i < mas.length; i++) {
            mas[i] = s.nextInt();
        }
        for (int i = 0; i < res.length-1; i++) {
            res[i] = Math.abs(mas[i] - mas[i+1]); 
        }
        res[k-1] = Math.abs(mas[k-1]-mas[0]);
        int min = min(res);
        int min1 = 0;
        if(min==k) min1=1; else min1 = min+1;
        System.out.println(min+" "+ min1);
        
    }

    private static int min(int[] res) {
        // TODO Auto-generated method stub
        int max = 100000000;
        for (int i = 0; i < res.length; i++) {
            if(res[i]<max) {
                max = res[i];
            }
        }
        
        for (int i = 0; i < res.length; i++) {
            if(res[i]==max){
                return ++i;
            }
        }
        
        return 0;
    }

}
