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;
import java.util.Arrays;

public class Reconnaissance2{
    public static void main(String [] args){
        Scanner input = new Scanner(System.in);
        int masuk = input.nextInt();
        int[] arr = new int[masuk];
        for(int i = 0; i<masuk; i++){
            arr[i] = input.nextInt();
        }
        int a = 0;
        int b = 1;
        int beda = Math.abs(arr[a] - arr[b]);
        for(int i = 0; i<masuk-1; i++){
            int temp = Math.abs(arr[i] -arr[i+1]);
            if(temp<beda){
                beda = temp;
                a = i;
                b = i+1;
            }
        }
        int temp = Math.abs(arr[masuk-1]-arr[0]);
        if(temp<beda){
            beda = temp;
            a = masuk-1;
            b = 0;
        }
        
        a = a+1;
        b = b+1;
        System.out.println(a+" "+b);
    }
}