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.util.*;
     
     
    public class Main {
        
        public static void main(String[] args) {
            Scanner input=new Scanner(System.in);
            int t=input.nextInt(),s,c=0;
            int a[]=new int[t];
            ArrayList<Integer>ar=new ArrayList<>();
            for(int i=0;i<t;i++){
                s=input.nextInt();
                a[i]=s;
            
            }
            for(int i=0;i<t-1;i++){
                ar.add(Math.abs(a[i]-a[i+1]));
            }
            ar.add(Math.abs(a[t-1]-a[0]));
            Integer min = Collections.min(ar);
            int indexOf = ar.indexOf(min);
            if(indexOf+1==t){
                System.out.println(t+" "+1);}
            else
            System.out.println((indexOf+1)+" "+(indexOf+2));
        }
        
        
    }
    
    
