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;

public class Reconnaissance2 {


        static class FastReader {
            BufferedReader br;
            StringTokenizer st;


            public FastReader() {
                br = new BufferedReader(new InputStreamReader(System.in));
            }

            String next() {
                while (st == null || !st.hasMoreElements()) {
                    try {
                        st = new StringTokenizer(br.readLine());
                    } catch (IOException e) {
                        e.printStackTrace();
                    }
                }
                return st.nextToken();
            }

            int nextInt() {
                return Integer.parseInt(next());
            }

            long nextLong() {
                return Long.parseLong(next());
            }

            double nextDouble() {
                return Double.parseDouble(next());
            }

            String nextLine() {
                String str = "";
                try {
                    str = br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                return str;
            }
        }

        public static void main(String[] args) {
            FastReader fr=new FastReader();
            int n=fr.nextInt();

            int min=Integer.MAX_VALUE;
            int minindex=-1;
            int arr[]=new int[n];
            for(int i=0;i<n;i++)
            {
             arr[i]=fr.nextInt();
            }

            for(int i=1;i<n;i++)
            {
                if(Math.abs(arr[i-1]-arr[i])<min)

                {
                    min=Math.abs(arr[i-1]-arr[i]);
                    minindex=i;
                }

            }

            if(Math.abs(arr[0]-arr[n-1])<min)
                {
                    System.out.println(n+" "+1);
                }
            else
                System.out.println(minindex+" "+(minindex+1));

        }



}
