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.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner (System.in);
		int loop  = in.nextInt();
		in.nextLine();
		int diff = -1;
		int pos1 = -1;
		int pos2 = -1;
		int numbers[] = new int [loop];
		for(int i = 0 ; i < loop ; i++) {
			numbers[i] = in.nextInt();
		}
		for(int  i = 0 ; i<loop ; i++) {
			for( int i2 = i-1 ; i2!=i+1 ; i2++) {
				if(i2<0){
					i2=loop-1;
				}else if(i2>loop-1) {
					i2 = 0;
				}
				if(i!=i2) {
					int check = Math.abs(numbers[i]-numbers[i2]);
					if(check<diff || diff == -1) {
						diff = check;
						pos1 = i;
						pos2 = i2;
					} 
				}
			}
		}
		System.out.println((pos1+1) + " " +(pos2+1) );
	}

}
