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 Soldiers 
{
    public static void main(String[] args) 
    {
    	int n, a[], b[];
    	Scanner t = new Scanner(System.in);
    	n = t.nextInt();
    	a = new int[n];
    	b = new int[n];
    	for(int i=0; i<n; i++)
    		a[i] = t.nextInt();
    	for(int i=0; i<n; i++)
    	{
    		if(i==n-1)
    		{
    			if(a[i]>a[0])
    				b[i] = a[i]-a[0];
    			else
    				b[i] = a[0]-a[i];
    		}
    		else
    		{
    			if(a[i]>a[i+1])
    				b[i] = a[i]-a[i+1];
    			else
    				b[i] = a[i+1]-a[i];
    		}			 	 
    	}    	
    	int p=-1;
    	int min = 1001;
    	for(int i=0; i<n; i++)
    		if(min>b[i])
    		{
    			min = b[i];
    			p = i;
    		}
    	if(p==n-1)
    		System.out.println(n+" "+1);
    	else
    		System.out.println((p+1)+" "+(p+2));			
    }
}
