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.*;
public class reconnaissance {

	public static void main(String[] args) {
	Scanner input=new Scanner(System.in);
	int n=input.nextInt();
	int d=1,c=1,e=1,f=1;
	int a[]=new int[n];
    for(int i=0;i<n;i++) {
    a[i]=input.nextInt();
    }
    for(int i=0;i<n;i++) {
        if(i==0) {
        	if(a[i]>a[n-1]||a[i]==a[n-1]) {
        	d=a[i]-a[n-1];
        	}
        	if(a[i]<a[n-1]) {
        		d=a[n-1]-a[i];	
        	}
        	e=i+1;
        	f=n;
        }
        if(i<n-1) {
        	if(a[i]>a[i+1]||a[i]==a[i+1]) {
        		c=a[i]-a[i+1];
        	}
        	if(a[i]<a[i+1]) {
        		c=a[i+1]-a[i];	
        	}
        }
        if(d>c) {
        	d=c;
        	e=i+1;
        	f=i+2;
        }
        
        }
       System.out.print(e+" ");
       System.out.print(f);
	}
}
