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
//package CF;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class A1 {

    public static void main(String [] args) throws NumberFormatException, IOException {
	Scanner bf = new Scanner(System.in);
	PrintWriter out = new PrintWriter(System.out);
	int n = bf.nextInt();
	int x = 0, y = 1;
	int [] a = new int[n];
	for (int i = 0; i < n; i++)
	    a[i] = bf.nextInt();
	for (int i = 0; i < a.length; i++)
	{
	    int ind = i-1;
	    if(i-1 < 0)
		ind = n-1;
	    if(Math.abs(a[x]-a[y]) > Math.abs(a[ind]-a[i]))
	    {
		x = ind; y = i;
	    }
	    ind = i+1;
	    if(i+1 >= n) ind = 0;
	    if(Math.abs(a[x]-a[y]) > Math.abs(a[ind]-a[i]))
	    {
		x = ind; y = i;
	    }
	}
	out.println((x+1) + " " + (y+1));
	out.flush();
	out.close();
    }

    static class Scanner{
	BufferedReader br;
	StringTokenizer st;
	public Scanner(InputStream b){
	    br = new BufferedReader(new InputStreamReader(b));
	}
	public String next() throws IOException{
	    while(st == null || !st.hasMoreTokens())
		st = new StringTokenizer(br.readLine());
	    return st.nextToken();
	}
	public int nextInt() throws NumberFormatException, IOException{
	    return Integer.parseInt(next());
	}
	public String nextLine() throws IOException{
	    return br.readLine();
	}
	public boolean ready() throws IOException{
	    return br.ready();
	}
    }
}
