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.FileReader;
import java.io.InputStreamReader;

public class Sorter {
    int[] in;
    int a=0,b=0;
    public Sorter(int[] in){
        this.in = in;
    }
    public Sorter() {}

    void neighbour(){
        
        int min= Integer.MAX_VALUE;
        for(int i=0;i<in.length-1;i++){
            if(i==0){
                
                    min = Math.abs(in[0] - in[in.length-1]);
                    a = 0;b=in.length-1;
                            
                }
                
                if(Math.abs(in[i] - in[i+1]) < min){
                    min = Math.abs(in[i] - in[i+1]);
                    a = i;b=i+1;
                            
                }
                
            
        }
    
    }
    
    

    void reader(){

        BufferedReader br = null;

        try {

            String sCurrentLine;
            String[] currentIn;
            br = new BufferedReader(new InputStreamReader(System.in));
            sCurrentLine = br.readLine();
            initAll(sCurrentLine);
            currentIn = new String[in.length];
            int count=0;
            sCurrentLine = br.readLine();
            currentIn = sCurrentLine.split(" ");
            while (count<in.length) {
                in[count] = Integer.parseInt(currentIn[count]);
                count++;
            }
        }
        catch (Exception e) {
            e.printStackTrace();

        }

    }

    void initAll(String s){
        in = new int[Integer.parseInt(s)];
    }



    public static void main(String args[]){

        Sorter s = new Sorter();
        s.reader();
        s.neighbour();
        System.out.println((s.a+1)+" "+(s.b+1));
    }
}
