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.InputStreamReader;

public class ReconnaissanceCF {

	private void start() {
		try {
			BufferedReader reader = new BufferedReader(new InputStreamReader(

			System.in));
			int n = Integer.valueOf(reader.readLine());
			String[] xx = reader.readLine().split(" ");
			int[] x = new int[n];
			int min = Integer.MAX_VALUE;
			for (int i = 0; i < n; ++i) {
				x[i] = Integer.valueOf(xx[i]);
			}
			int[] r = new int[2];
			int d = 0;
			for(int i=1;i<n;++i){
				d = Math.abs(x[i]-x[i-1]);
				if(d<min){
					min=d;r[0]=i-1;r[1]=i;
				}
			}
			d=Math.abs(x[x.length-1]-x[0]);
			if(d<min){
				r[0]=x.length-1;r[1]=0;
			}
			System.out.println((r[0]+1)+" "+(r[1]+1));

		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	public static void main(String[] args) {
		new ReconnaissanceCF().start();
	}
}