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.*;
import java.util.*;
public class Mohammad  {
    //---------------------------------------------Main-----------------------------------------------//
    public static void Mohammad_AboHasan() throws IOException{
        FastReader fr = new FastReader();
        int n = fr.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) 
            a[i] = fr.nextInt();
        int min = Integer.MAX_VALUE, max = a[0];
        int ind1 = 0, ind2 = 0;
        for (int i = 0; i < n-1; i++)
            if(Math.abs(a[i]-a[i+1]) < min){
                min = Math.abs(a[i]-a[i+1]);
                ind1 = i+1;
                ind2 = i+2;
            }
        System.out.println(Math.abs(a[n-1]-a[0]) < min ? n + " " + 1 : ind1 + " " + ind2);
    }
    public static void main(String[] args) throws IOException{
        Mohammad_AboHasan();
    }
    //---------------------------------------------FAST I/O-----------------------------------------------//
    static class FastReader{
        BufferedReader br;
        StringTokenizer st;
        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        String next() throws IOException{
            while (st == null || !st.hasMoreElements()) {
                    st = new StringTokenizer(br.readLine());
            }
            return st.nextToken();
        }
        int nextInt() throws IOException{
            return Integer.parseInt(next());
        }
        long nextLong() throws IOException{
            return Long.parseLong(next());
        }
        double nextDouble() throws IOException{
            return Double.parseDouble(next());
        }
        String nextLine() throws IOException{
            String s = br.readLine();
            return s;
        }
    }
}