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
// Dummy text
import java.io.*; 
import java.util.*; 
  public class hef
  {  
    public static void main(String[] args) throws IOException 
    { 
      BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); 
      
           String line = br.readLine(); 
            String[] strs = line.trim().split("\\s+");
           int n = Integer.parseInt(strs[0]);
           
           int arr[] = new int[n];
           // to read multiple integers line 
             line = br.readLine(); 
             strs = line.trim().split("\\s+"); 
            // array elements input 
            for (int i = 0; i < n; i++) 
            arr[i] = Integer.parseInt(strs[i]);
            int min=100000;
            int pos=0;
            for(int i=0;i<n;i++)
            {
                int max=(int)Math.max(arr[i]-arr[(i+1)%n],  arr[(i+1)%n]-arr[i]);
                if(max<min)
                {
                    min=max;
                    pos=i;
                }
            }
            if(n!=2 && pos+2!=n)
            System.out.println((pos+1) +" "+(pos+2)%n);
            else
            System.out.println((pos+1)+" "+n);
        }
        }
        