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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Reconnaissance2 implements Runnable
{
    private void solve() throws Exception
    {
        int n = nextInt();
        int[] sold = new int[n];
        for(int i = 0; i < n; ++i)
            sold[i] = nextInt();
        int res = 1000, idx = -1;
        for(int i = 0; i < n - 1; ++i)
            if(res > Math.abs(sold[i] - sold[i + 1]))
            {
                res = Math.abs(sold[i] - sold[i + 1]);
                idx = i + 1;
            }
        if(res > Math.abs(sold[n - 1] - sold[0]))
            idx = n;
        writer.println(idx + " " + (idx + 1 > n ? 1 : idx + 1));
    }

    BufferedReader reader;
    StringTokenizer tokenizer;
    PrintWriter writer;

    public static void main(String[] args)
    {
        new Reconnaissance2().run();
    }

    public void run()
    {
        try
        {
            reader = new BufferedReader(new InputStreamReader(System.in));
            //reader = new BufferedReader(new FileReader("template.in"));
            tokenizer = null;
            writer = new PrintWriter(System.out);
            //writer = new PrintWriter("template.out");
            solve();
            reader.close();
            writer.close();
        }
        catch (Exception ex)
        {
            ex.printStackTrace();
            System.exit(1);
        }
    }

    private int nextInt() throws IOException
    {
        return Integer.parseInt(nextToken());
    }

    private long nextLong() throws IOException
    {
        return Long.parseLong(nextToken());
    }

    private double nextDouble() throws IOException
    {
        return Double.parseDouble(nextToken());
    }

    private String nextToken() throws IOException
    {
        while(tokenizer == null || !tokenizer.hasMoreTokens())
            tokenizer = new StringTokenizer(reader.readLine());
        return tokenizer.nextToken();
    }
}
