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 ReconTwo{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int size = sc.nextInt();
		int[] arr = new int[size];
		for(int i = 0;i<size;i++)arr[i]=sc.nextInt();
		int dex1  = 0;
		int dex2 = 0;
		int min = 1000000;
		for(int i = 0;i<size-1;i++){
			if(Math.abs(arr[i]-arr[i+1])<min){
				min = Math.abs(arr[i]-arr[i+1]);
				dex1 = i+1;
				dex2 = i+2;
			}
		}
		if(Math.abs(arr[0]-arr[size-1])<min){
			System.out.println(1+" "+size);
		}else{
			System.out.println(dex1+" "+dex2);
		}
	}
}