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

/**
 * 
 * 
 0 1 2 3 4
 
 3 4 0
 
 
 (4+5-1)%5
 * 
 * */
public class A_Div2_34 {

    public static void main(String[] args) throws IOException
    {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        int n,i,j,ni,nj,min,mp;
        n = Integer.parseInt(in.readLine());
        int[]a = new int[n];
        StringTokenizer st = new StringTokenizer(in.readLine());
        for(i = 0; i < n; i++)
        {
            a[i] = Integer.parseInt(st.nextToken());
        }
        min = Integer.MAX_VALUE;
        ni = nj = 0;
        for(i = 0; i < n; i++)
        {
            j = (i + n - 1)%n;
            mp = Math.abs(a[i] - a[j]);
            if(mp < min)
            {
                min = mp;
                ni = i;
                nj = j;
            }
            j = (i+1)%n;
            mp = Math.abs(a[i] - a[j]);
            if(mp < min)
            {
                min = mp;
                ni = i;
                nj = j;
            }
        }
        ni++; nj++;
        System.out.println(ni + " " + nj);
    }

}
