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.*;
import java.math.*;


public class Reconnaissance2
{	
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int[] ar = new int[n];
		int p1 = 0, p2 = 0, min = 1001;
		
		for(int i = 0; i < n; ++i)
			ar[i] = in.nextInt();
		
		for(int i = 0; i < ar.length - 1; ++i)
		{
			if(Math.abs(ar[i] - ar[i + 1]) < min)
			{
				min = Math.abs(ar[i] - ar[i + 1]);
				p1 = i + 1;
				p2 = i + 2;
			}
		}
		
		if(Math.abs(ar[0] - ar[ar.length - 1]) < min)
		{
			p1 = 1;
			p2 = ar.length;
		}
		
		System.out.println(p1 + " " + p2);
	}
}

