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
// 34A - Reconnaissance 2
// https://codeforces.com/problemset/problem/34/A

import java.util.Scanner;

public class CF34A {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int first = sc.nextInt();
        int index1 = 0;
        int index2 = 0;
        int prev = first;
        int reconnaissance = 1000;
        for (int i = 2; i <= n; i++) {
            int current = sc.nextInt();
            int diff = Math.abs(current - prev);
            if (diff < reconnaissance) {
                reconnaissance = diff;
                index1 = i - 1;
                index2 = i;
            }
            prev = current;
        }
        int diff = Math.abs(first - prev);
        if (diff < reconnaissance) {
            index1 = n;
            index2 = 1;
        }
        System.out.println(index1 + " " + index2);
        sc.close();

    }
}
