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.io.*;
import java.util.*;
public class A34 {
    public static void main(String[] args)throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        int[] ind = new int[n];
        String[] in = br.readLine().split(" ");
        for(int i=0;i<n;i++)
            ind[i] = Integer.parseInt(in[i]);
        int min = Integer.MAX_VALUE;
        int[] index = new int[2];
        int i=0;
        for(i=0;i<n;i++){
            if(min>Math.abs(ind[i] - ind[(i+1)%n])){
                min = Math.abs(ind[i] - ind[(i+1)%n]);
                index[0] = i+1;
                index[1] = ((i+1)%n)+1;
            }
        }
        System.out.println(index[0]+" "+index[1]);
    }
}