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 arr[] = new int[n]; 
        
        for(int i = 0 ; i < n ; i++)
        {
            arr[i] = Sc.nextInt();
        }
        
        int min = Integer.MAX_VALUE;
        int x = 0;
        int y = 0;
        
        for(int i = 0 ; i < n ; i++)
        {
            int a = i;
            int b =(i+1)%n;
            int d = arr[a] - arr[b];
            if(d < 0) d = -1*d;
            
            if(d == 0) 
            {
                x = a+1;
                y = b+1;
                break;
            }
            
            if(d < min)
            {
                min = d;
                x = a+1;
                y = b+1;
            }
        }
        
        System.out.println(x + " " + y);
        
    }
}