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.awt.datatransfer.SystemFlavorMap;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] lengths = new int[n];

        for (int i = 0; i < n; i++) {
            lengths[i] = sc.nextInt();
        }
        int min1 = n;
        int min2 = 1;
        int dif = Math.abs(lengths[0] - lengths[n-1]);
        //System.out.print(dif);
    //-----------------------------------------

        for (int i = 0; i < n-1; i++) {
           int temp = Math.abs(lengths[i] - lengths[i+1]);
           if(dif>temp){

               min1=i+1;
               min2=i+2;
               dif = temp;

           }


        }

        System.out.print(min1 + " " + min2);


    }
}

/*


/*
        Scanner sc = new Scanner(System.in);
        String word = sc.next().toLowerCase();
        String wordCap = word.toUpperCase();
        System.out.print(wordCap.charAt(0));
        for (int i = 1; i < word.length(); i++) {
            System.out.print(word.charAt(i));
        }*/

/*
    Scanner sc = new Scanner(System.in);
    String word1 = sc.next().toLowerCase();
    String word2 = sc.next().toLowerCase();
    int word1V = 0 , word2V = 0;

        for (int i = 0; i < word1.length() ; i++) {
        word1V = word1V + word1.charAt(i);
        }

        for (int i = 0; i < word1.length() ; i++) {
        word2V = word2V + word2.charAt(i);
        }



        if ( word1V < word2V) System.out.print(-1);
        else if (word2V<word1V)System.out.print(1);
        else if(word1V == word2V) System.out.print(0);


   */
