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
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author ckapr
 */

    
import java.util.*;
import java.math.*;
public class NewClass
{
    
    
	public static void main(String[] args) {
	    Scanner sc = new Scanner(System.in);
            int n=sc.nextInt();
            
            int[] arr = new int[n];
            int mdiff =Integer.MAX_VALUE,inx=0;
            for(int i=0;i<n;i++)
            {
                arr[i]=sc.nextInt();
            }
            for(int i=0;i<n;i++)
            {
                int diff = Math.abs(arr[i] - arr[(i+1)%n]);
                if(diff<mdiff)
                {
                    mdiff=diff;
                    inx = i;
                } //System.out.println(diff);
            }
            System.out.println(inx+1+" "+(((inx+1)%n)+1));
          
           
            System.out.println();
	
		
	}


}