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.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;



public class Code {
    static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer token;
    public static void main(String asd[])throws Exception{
        int input = Integer.parseInt(reader.readLine());
        token = new StringTokenizer(reader.readLine());
        int [] list = new int[input];
        for (int i = 0; i < input; i++) {
            list[i] = Integer.parseInt(token.nextToken());
        }
        int best=Math.abs(list[0] - list[input - 1]);
        int idx = input - 1;
        for (int i = 1; i < input; i++) {
            int x = Math.abs(list[i -1] - list[i]);
            if(x < best){
                best = x;
                idx = i - 1;
            }
        }
        
        if(idx == input - 1){
            idx++;
            System.out.println(idx + " " + 1);
        }else{
            idx++;
            System.out.println(idx + " " + (idx + 1));
        }
    }
    
}
