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.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
        String s;
        s = r.readLine();
        int n = Integer.parseInt(s);
        s = r.readLine();
        String[] split = s.split(" ");
        int[] array = new int[n];
        for (int i = 0; i < split.length; i++) {
            String value = split[i];
            array[i] = Integer.parseInt(value);
        }

        solve(array);
    }

    private static void solve(int[] array) {
        int min = 1000;
        int mini = 0, minj = 0;
        for (int i = 0; i < array.length; i++) {
            int j = (i + 1) % array.length;
            int diff = array[i] - array[j];
            diff = diff < 0 ? -diff : diff;
            if (diff < min) {
                min = diff;
                mini = i;
                minj = j;
            }
        }
        System.out.println((mini + 1) + " " + (minj + 1));
    }
}
