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;


public class Main {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader r=new BufferedReader(new InputStreamReader(System.in));
		String s=r.readLine();
		s=r.readLine();
		String[] sp=s.split(" ");
		int[] num=new int[sp.length];
		for(int i=0;i<sp.length;i++)num[i]=Integer.parseInt(sp[i]);
		int[] dif=new int[sp.length];
		for(int i=0;i<sp.length-1;i++)
			dif[i]=Math.abs(num[i]-num[i+1]);
		dif[sp.length-1]=Math.abs(num[0]-num[sp.length-1]);
		int minIndex=-1;
		int min=100000000;
		for(int i=0;i<dif.length;i++){
			if(min>dif[i]){
				min=dif[i];
				minIndex=i;
			}
		}
		if(minIndex==sp.length-1){
			System.out.println(sp.length+" "+ 1);
		}
		else System.out.println((minIndex+1)+" "+(minIndex+2));
	}

}
