import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;


public class B {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();

        int[] array = new int[n];
        Map<Integer, Interval> map = new HashMap<Integer,Interval>();

        for(int i = 0; i < n; i++) {
            array[i] = scanner.nextInt();
            if(map.get(array[i]) == null) {

                Interval v = new Interval();
                v.setBegin(i);
                v.occ++;

                map.put(array[i], v);

            }
            else {
                map.get(array[i]).occ++;
                map.get(array[i]).seEnd(i);

            }

        }

        int max = -1;
        int key = -1;
        for(Map.Entry<Integer, Interval> entry : map.entrySet()) {
            if(entry.getValue().occ > max) {
                max = entry.getValue().occ;
                key = entry.getKey();

            }

        }

        int min = Integer.MAX_VALUE;
        int b = 0;
        int e = 0;

        for(Map.Entry<Integer, Interval> entry : map.entrySet()) {
            if(entry.getValue().occ == max && entry.getValue().dis < min) {
                min = entry.getValue().dis;
                b = entry.getValue().b;
                e = entry.getValue().e;

            }

        }

        System.out.println((b + 1) + " " + (e + 1));

    }

    static class Interval {

        private int occ;
        private int b;
        private int e;
        private int dis;

        public void setBegin(int b) {
            this.b = b;
            this.dis = e - b;

        }

        public void seEnd(int e) {
            this.e = e;
            this.dis = e - b;

        }

        public int getDis() {
            return this.dis;

        }

    }


}