Problem: 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

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class AmrandTheLargeArray {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        int n = sc.nextInt();
        triplet[] arr = new triplet[(int)Math.pow(10,6)+1];
        for(int i = 0; i<Math.pow(10,6)+1; i++){
            arr[i] = new triplet(0,0,0);
        }
        int max=0;
        for(int i = 1; i<=n; i++){
            int x = sc.nextInt();
            if(arr[x].start==0){arr[x].start = i;}
            arr[x].end = i;
            arr[x].counter++;
            max=Math.max(max,arr[x].counter);
        }
        PriorityQueue<triplet> pq = new PriorityQueue<>();
        for(int i = 1; i<arr.length; i++){
            if(arr[i].counter==max){
                pq.add(arr[i]);
            }
        }
        triplet answer = pq.poll();
        System.out.println((answer.start) +" " + (answer.end));

        out.flush();
    }

    static class triplet implements Comparable<triplet>{
        int counter = 0; int start = 0; int end = 0;
        public triplet(int counter, int start, int end){
            this.counter = counter; this.start = start; this.end = end;
        }
        public int compareTo(triplet o){
            return (end-start+1)-(o.end-o.start+1);
        }
    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream system) {
            br = new BufferedReader(new InputStreamReader(system));
        }

        public Scanner(String file) throws Exception {
            br = new BufferedReader(new FileReader(file));
        }

        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        public String nextLine() throws IOException {
            return br.readLine();
        }

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

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

        public char nextChar() throws IOException {
            return next().charAt(0);
        }

        public Long nextLong() throws IOException {
            return Long.parseLong(next());
        }

        public boolean ready() throws IOException {
            return br.ready();
        }

        public void waitForInput() throws InterruptedException {
            Thread.sleep(3000);
        }
    }
}