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 Ahmed Nasr Harg
 */
public class Reconnaissance2 {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int a0=sc.nextInt();
        int a1=a0;
        int[] arr=new int[n];
        int a2;
        for(int i=0;i<n-1;i++){
             a2=sc.nextInt();
            arr[i]=Math.max(a1-a2, (a1-a2)*-1);
            a1=a2;
        }
        arr[n-1]=Math.max(a0-a1, (-1)*(a0-a1));
        int x=0,y=0,min=arr[0];
        for(int i=0;i<n;i++){
            if(arr[i]<=min){
                x=i+1;
                y=i+2;min=arr[i];
            }            
        }
        if(y==n+1){y=1;}
        System.out.println(x+" "+y);
    }
}
