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
/******************************************************************************

                            Online Java Compiler.
                Code, Compile, Run and Debug java program online.
Write your code in this editor and press "Run" button to execute it.

*******************************************************************************/
import java.util.*;
public class Main
{
	public static void main(String[] args) {
	Scanner sc=new Scanner(System.in);
	
	int n=sc.nextInt();
	int arr[]=new int[100];
	int i;
	for(i=0;i<n;i++)
	arr[i]=sc.nextInt();
	
	int j;
	int i1=0,i2=0,d1,d2,min=100000;
	for(i=0;i<n-1;i++)
	{
	    if(i!=0 && i!=n-1)
	    {
	      d1=Math.abs(arr[i+1]-arr[i]);
	     d2=Math.abs(arr[i-1]-arr[i]);
	           
	       if(d1<=d2 && d1<=min)
	       {
	           min=d1;
	           i1=i+1;
	           i2=i;
	       }
	       if(d2<=d1 && d2<=min)
	       {
	           min=d2;
	           i1=i;
	           i2=i-1;
	       }
	    }
	    else
	    {
	        if(i==0)
	      {
	        d1=Math.abs(arr[i+1]-arr[i]);
	         d2=Math.abs(arr[n-1]-arr[i]);
	          
	          if(d1<=d2 && d1<=min)
	       {
	           min=d1;
	           i1=i+1;
	           i2=i;
	       }
	       if(d2<=d1 && d2<=min)
	       {
	           min=d2;
	           i1=i;
	           i2=n-1;
	       }
	      }
	      else
	      {
	            d1=Math.abs(arr[i-1]-arr[i]);
	              d2=Math.abs(arr[0]-arr[i]);
	          
	           if(d1<=d2 && d1<=min)
	       {
	           min=d1;
	           i1=i;
	           i2=i-1;
	       }
	       if(d2<=d1 && d2<=min)
	       {
	           min=d2;
	           i1=i;
	           i2=0;
	       }
	      
	      }
	      
	    }
	}
	System.out.println((i1+1)+" "+(i2+1));
	
		sc.close();
	
	}
}
