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 pew = new Scanner(System.in);
		
		int n = pew.nextInt();
		
		int a[] = new int[n+1];
		
		for(int i = 0 ; i<n; i++){
			
			a[i] = pew.nextInt();
		}
		
		a[n] = a[0]; 
		
		int A = -2, B = -1;
		
		int diff = Integer.MAX_VALUE;
		
		for(int i = 0 ; i<n; i++){
			if(Math.abs(a[i]-a[i+1])<diff){
				diff = Math.abs(a[i]-a[i+1]);
				A = i;
				B = i+1;
			}
		}
		if(B == n) B = 0;
		
		System.out.println(A+1+" " + (B+1));
		
	}

}
