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 neig{
public static void main(String args[]) throws IOException{
BufferedReader lector = new BufferedReader(new InputStreamReader(System.in));
int tmp = Integer.parseInt(lector.readLine());
String t[] = lector.readLine().split(" ");
int r[] = new int[tmp];
for(int n = 0;n<t.length;n++)
r[n]=Integer.parseInt(t[n]);
int min = Integer.MAX_VALUE;
int a = 0;
int b = 0;
for(int n = 1;n<=r.length;n++){
int d= Math.abs(r[n%r.length]-r[n-1]);
if(d<min){
min = d;
a = n%r.length+1;
b = n;
}
}
System.out.println(a+" "+b);
}
}
