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.Scanner;

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author Ameera
 * Codeforces: 34A
 */
public class reconnaissance2 {
    
    public static void main(String[] args){
        
        Scanner in = new Scanner(System.in);
        
        int n = in.nextInt();
        
        int[] a = new int[n];
        
        for (int i = 0; i < n; i++) {
            a[i]=in.nextInt();
        }
        
        int d = Integer.MAX_VALUE;
        
        int s1 = n-1;
        int s2 = 0;
        
        d = Math.abs(a[n-1]-a[0]);
        
        for (int i = 1; i < n; i++) {
            if(Math.abs(a[i]-a[i-1])<d){
                d=Math.abs(a[i]-a[i-1]);
                s1=i-1;
                s2=i;
            }
        }
        
        System.out.println((s1+1)+" "+(s2+1));
    }
    
}
