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.Arrays;
import java.util.Comparator;
import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author teacher
 */
public class NewClass {
    static class Soldat{

        public Soldat(int i, int rost) {
            this.i = i;
            this.rost = rost;
        }
        
        int i;
        int rost;
    }
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        Soldat a[] = new Soldat[n];
        for(int i = 0;i<n;i++){
            int r = in.nextInt();
            a[i]=new Soldat(i+1,r);
        }
        /*Arrays.sort(a,new Comparator<Soldat>() {

            public int compare(Soldat o1, Soldat o2) {
                return o1.rost-o2.rost;
            }
        });*/
        int min =Math.abs(a[0].rost-a[n-1].rost);
        int sold1=1,sold2=n;
        for(int i = 0;i<n-1;i++){
            if(Math.abs(a[i].rost-a[i+1].rost)<min){
                sold1 = a[i].i;
                sold2 = a[i+1].i;
                min = Math.abs(a[i].rost-a[i+1].rost);
            }
        }
        System.out.println((sold1)+" "+(sold2));
    }

}
