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;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.*;
import java.math.BigInteger;

public class Template implements Runnable {
	
	BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
	StringTokenizer tokenizer = null;
	PrintWriter out = new PrintWriter(System.out);
	
	public static void main (String[] args) {
		new Thread(new Template()).start();
	}
	
	int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}
	
	long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}
	
	double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}
	
	String nextToken() throws IOException {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			tokenizer = new StringTokenizer(in.readLine());
		}
		return tokenizer.nextToken();
	}
	
	public void run(){
		try {
			solve();
			end();
		} catch (IOException e) {
			e.printStackTrace();
			System.exit(1);
		}
	}
	
	public void solve() throws IOException{
		int n = nextInt(), min = Integer.MAX_VALUE, mi = -1, mj = -1;
		int[] arr = new int[n];
		for(int i = 0; i < n; i++) arr[i] = nextInt();
		
		for(int i = 0; i < n; i++) 
			if(Math.abs(arr[i]-arr[(i+1)%n]) < min){
				min = Math.abs(arr[i]-arr[(i+1)%n]);
				mi = i+1;
				mj = (i+1)%n+1;
			}
		out.println(mi + " " + mj);
	}
	
	public void end() throws IOException{
		in.close();
		out.close();
	}
}
