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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;


public class Reconnaissance {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine()); int sum =0;
		String [] spliter = br.readLine().split(" ");
		int pos1=0; int pos2=0; int min = Integer.MAX_VALUE;
		for (int i=0;i<spliter.length;i++){
			if (i==spliter.length-1){
				if (min> Math.abs(Integer.parseInt(spliter[i])-Integer.parseInt(spliter[0]))){
					pos1 = i+1; pos2 = 1;}
				}
			else
				if (min > Math.abs(Integer.parseInt(spliter[i])-Integer.parseInt(spliter[i+1]))){
					pos1=i+1; pos2=i+2; min=Math.abs(Integer.parseInt(spliter[i])-Integer.parseInt(spliter[i+1]));
				}
						
		} 
		System.out.println(pos1+ " " + pos2);
		
		
}
}
