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.Arrays;
import java.util.Scanner;


public class Main {

	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		
		int in1 = 0,in2 = 0;
		int num=in.nextInt();
		int[] data=new int[num];
		int[] temp=new int[num];
		data[0]=in.nextInt();
		int min=1001;
		for(int i=1;i<num;i++)
		{
			data[i]=in.nextInt();
			if(Math.abs(data[i]-data[i-1])<min)
			{
				min=Math.abs(data[i]-data[i-1]);
				in1=i-1;
				in2=i;
			}
		}
		if(Math.abs(data[num-1]-data[0])<min)
		{
			min=Math.abs(data[num-1]-data[0]);
			in1=0;
			in2=num-1;
		}	
		System.out.print((in1+1)+" "+(in2+1));
	}

}
