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
/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		Scanner input = new Scanner(System.in);
		int n = input.nextInt();
		ArrayList<Integer> arr = new ArrayList<Integer>();
		for(int i = 0;i<n;i++){
		    arr.add(input.nextInt());
		}
		int min = Integer.MAX_VALUE;
		int index1  = 0;
		int index2 = 0;
		
		
		for(int i=0;i<n;i++){
		    
		    int j = 0;
		    if(i!=(n-1)){
		        j=i+ 1;
		    }
		    int x = arr.get(i);
		    int y = arr.get(j);
		    int diff = Math.abs(x-y);
		    if(diff<min){
		        min = diff;
		        index1 = i+1;
		        index2 = j+1;
		    }
		    
		    
		    
		}
		System.out.print(index1+" "+index2);
	}
}
