Amr has got a large array of size n. Amr doesn't like large arrays so he intends to make it smaller.

Amr doesn't care about anything in the array except the beauty of it. The beauty of the array is defined to be the maximum number of times that some number occurs in this array. He wants to choose the smallest subsegment of this array such that the beauty of it will be the same as the original array.

Help Amr by choosing the smallest subsegment possible.

Input

The first line contains one number n (1 ≤ n ≤ 105), the size of the array.

The second line contains n integers ai (1 ≤ ai ≤ 106), representing elements of the array.

Output

Output two integers l, r (1 ≤ l ≤ r ≤ n), the beginning and the end of the subsegment chosen respectively.

If there are several possible answers you may output any of them. 

Examples

Input

5
1 1 2 2 1


Output

1 5

Input

5
1 2 2 3 1


Output

2 3

Input

6
1 2 2 1 1 2


Output

1 5

Note

A subsegment B of an array A from l to r is an array of size r - l + 1 where Bi = Al + i - 1 for all 1 ≤ i ≤ r - l + 1
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;

public class GLargeArray {
    public static void main(String[] args) {
        int[] array = new int[io.nextInt()],
              freq  = new int[(int) (1e6 + 1)],
              start = new int[(int) (1e6 + 1)],
              stop  = new int[(int) (1e6 + 1)];
        Arrays.fill(start, (int) (1e6 + 1));
        Arrays.fill(stop, -(int) (1e6 + 1));

        for (int i = 0; i < array.length; i++) {
            array[i] = io.nextInt();
            freq[array[i]]++;
            start[array[i]] = Math.min(start[array[i]], i);
            stop[array[i]]  = Math.max(stop[array[i]], i);
        }

        int max = Integer.MIN_VALUE;
        for (int n : freq)
            max = Math.max(max, n);

        int l = 1, r = array.length, range = array.length;
        for (int i = 0; i < freq.length; i++)
            if (freq[i] == max)
                if (stop[i] - start[i] < range) {
                    l = start[i] + 1;
                    r = stop[i]  + 1;
                    range = r - l;
                }

        io.println(l + " " + r);
        io.flush(); io.println();
    }

    static FastIO io = new FastIO(System.in);

    static class FastIO extends PrintWriter {
        private BufferedReader br;
        private StringTokenizer tk;
        private FileReader fr;

        FastIO(InputStream in) {
            this();
            br = new BufferedReader(new InputStreamReader(in));
        }

        FastIO(String location) {
            this();
            try {br = new BufferedReader(new FileReader(location));}
            catch (IOException e) {println(e); flush();}
        }

        private FastIO() {
            super(System.out);
            tk = new StringTokenizer("");
        }

        String nextLine() {
            try {
                return br.readLine();
            } catch (IOException ignored) { }

            return nextLine();
        }

        String next() {
            if (hasNext())
                return tk.nextToken();
            else
                tk = new StringTokenizer(nextLine());

            return next();
        }

        boolean hasNext() {
            return tk.hasMoreTokens();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        int[] nextIntArray(int length) {
            int[] array = new int[length];
            for (int i = 0; i < array.length; i++) {
                array[i] = nextInt();
            }
            return array;
        }

        void exit() {
            try {
                super.close();
                br.close();
            } catch (IOException ignored) { }
        }
    }
}
