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 codeforces;
import java.util.*;
public class Reconnaissance2 {
	static int index1;
	static int index2; 
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		int[] A = new int[N];
		for(int i = 0; i < N; i++) {
			A[i] = scan.nextInt(); 
		}
		//System.out.println(Arrays.toString(A));
		int smallest = 1000000000;
		
		for(int i = 1; i < N; i++) {
			int d = Math.abs(A[i] - A[i - 1]);
			if(d < smallest) {
				smallest = d; 
				index1 = i - 1;
				index2 = i; 
			}
			//System.out.println(smallest);
		}
		if(Math.abs(A[0] - A[A.length - 1]) < smallest) {
			index1 = 0;
			index2 = A.length- 1;
		}
		
		/*
		for(int i = 0; i < N; i++) {
			int h1 = A[i];
			for(int j = 0; j < N; j++) {
				//System.out.println(smallest);
				if(i != j) {
					int h2 = A[j];
					if(Math.abs(h2 - h1) < smallest) {
						smallest = Math.abs(h2 - h1);
						index1 = i;
						index2 = j; 
					} 
				}
			}
		}
		*/	
		index1 ++;
		index2 ++; 
		System.out.println(index1 + " " + index2);
	}

}
