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;

/**
 *
 * @author Hartha
 */
public class Reconnaissance2 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner sin = new Scanner(System.in);
        int min = Integer.MAX_VALUE, n = sin.nextInt(), a = 0 , b = 0;
        int arr[] = new int[n];
        arr[0] = sin.nextInt();
        for(int i = 1; i < n; i++)
        {
            arr[i] = sin.nextInt();
            if(Math.abs(arr[i]-arr[i-1]) < min)
            {
                min = Math.abs(arr[i]-arr[i-1]);
                a = i; b = i-1;
            }
        }
        if(Math.abs(arr[0] - arr[n-1] )< min)
        {
            a = 0; b = n-1;
        }
        System.out.println(++b +" " + ++a);
            
    }
    
}