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.io.*;

public class Main
{

	public static void main(String[] args)
	{
		Scan scan = new Scan();
		int n = scan.nextInt();
		int[] x = new int[3];
		x[1] = x[2] = scan.nextInt();
		int mindif = Integer.MAX_VALUE;
		int[] id = new int[2];
		for (int i = 0; i < n; i++)
		{
			if (i != n - 1)
			{
				x[0] = scan.nextInt();
				if (Math.abs(x[0] - x[1]) < mindif)
				{
					mindif = Math.abs(x[0] - x[1]);
					id[0] = i;
					id[1] = i + 1;
				}
				x[1]=x[0];
			} else
			{
				if (Math.abs(x[0] - x[2]) < mindif)
				{
					mindif = Math.abs(x[0] - x[2]);
					id[0] = i;
					id[1] = 0;
				}
			}
		}
		System.out.println((id[0]+1)+" "+(id[1]+1));
	}

}

class Scan
{

	BufferedReader br;
	StringTokenizer st;

	Scan()
	{
		br = new BufferedReader(new InputStreamReader(System.in));
	}

	public boolean hasNext()
	{
		while (st == null || !st.hasMoreElements())
		{
			try
			{
				st = new StringTokenizer(br.readLine());
			} catch (Exception e)
			{
				return false;
			}
		}
		return true;
	}

	public String next()
	{
		if (hasNext())
		{
			return st.nextToken();
		}
		return null;
	}

	public int nextInt()
	{
		if (hasNext())
		{
			return Integer.parseInt(st.nextToken());
		}
		return -1;
	}
}
