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) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String line;
		line = br.readLine();
		int n = Integer.parseInt(line);
		line = br.readLine();
		StringTokenizer token = new StringTokenizer(line);
		int[] soldiers = new int[n];
		for (int i = 0; i < n; i++) {
			soldiers[i] = Integer.parseInt(token.nextToken());
		}

		int min = Integer.MAX_VALUE;
		int index1, index2;
		index1 = -1;
		index2 = -1;
		for (int i = 0; i < n; i++) {
			if (Math.abs(soldiers[i] - soldiers[(i + 1) % n]) < min) {
				min = Math.abs(soldiers[i] - soldiers[(i + 1) % n]);
				index1 = i;
				index2 = (i + 1) % n;

			}
		}

		if (n != 0) {
			System.out.println((index1 + 1) + " " + (index2 + 1));
		}

	}

}

  	  		  	  			 		 	  				 	 		