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.*;
import java.lang.*;
import java.io.*;
import java.io.BufferedInputStream;
import java.io.IOException;
public final class codeforces {
    public static void main(String[]args)
    {
        Scanner scan = new Scanner(System.in);
        int size = scan.nextInt();
        int[] input = new int[size];
        int i = 0;
        while(i< size)
        {
            input[i] = scan.nextInt();
            i++;
        }
        i = 0;
        int min1 = Integer.MAX_VALUE, min2 = Integer.MAX_VALUE, diff = Integer.MAX_VALUE, curdiff = 0;
        while(i<size)
        {
            curdiff = Math.abs(input[i]-input[(i+1)%size]);
            if(curdiff < diff)
            {
                diff = curdiff;
                min1 = i+1;
                min2 = (i+1)%size+1;
            }
            i++;
        }
        System.out.println(min1+" "+ min2);
    }
}