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.*;
import java.util.*;

public class Reconnaissance2 {
    
    public static void main( String[] args ) throws IOException {
        
        BufferedReader in = new BufferedReader( new InputStreamReader( System.in ) );
        PrintWriter out = new PrintWriter( new BufferedWriter( new OutputStreamWriter( System.out ) ) );  
        
        int n = Integer.parseInt( in.readLine() );
        int[] a = new int[ n ];
        
        StringTokenizer tokens = new StringTokenizer( in.readLine() );
        
        for( int i = 0; i < n; i++ ) {
            
            a[ i ] = Integer.parseInt( tokens.nextToken() );
            
        }
        
        double min = Double.POSITIVE_INFINITY;
        int ans1 = 0;
        int ans2 = 0;
        
        for( int i = 0; i < n; i++ ) {
            
            int diff = 0;
            
            if( i < n - 1 ) {
                
                diff = Math.abs( a[ i ] - a[ i + 1 ] );
                
                if( diff < min ) {
                    min = diff;
                    ans1 = i + 1;
                    ans2 = i + 2;
                }
            }
            else {
                
                diff = Math.abs( a[ i ] - a[ 0 ] );
                
                if( diff < min ) {
                    
                    min = diff;
                    ans1 = i + 1;
                    ans2 = 1;
                }
            }
        }
        
        out.println( ans1 + " " + ans2 );
        out.flush();
        out.close();
    }
}