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 Sol
{
 public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		int n,i,j,x,a1=1,a2=2;
		n=in.nextInt();
		int a[]=new int[n];
		for(i=0;i<n;i++)
			a[i]=in.nextInt();
		int min=Math.abs(a[1]-a[0]);
		for(i=0;i<n;i++)
		{
			if(min==0)
				break;
			j=(i-1+n)%n;
			x=(int)Math.abs(a[j]-a[i]);
			if(x<min)
				{min=x;
					a1=(j+1);
					a2=(i+1);
			}
		}System.out.println(a1+" "+a2);

		}
}