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

/**
 * Created by yujiahao on 4/14/16.
 */
public class cf_312_b {
    private FastScanner in;
    private PrintWriter out;

    public void solve() throws IOException {
        int range = 1000001;
        int n = in.nextInt();
        int[] start = new int[range];
        int[] end   = new int[range];
        int[] times = new int[range];
        Arrays.fill(start,-1);

        int maxCount = 0;


        for (int i=0; i<n; i++){
            int curIndex = i+1;
            int cur = in.nextInt();
            if (start[cur]==-1){
                start[cur] = curIndex;
                end[cur] = curIndex;
            }else{
                end[cur] = curIndex;
            }
            times[cur]++;
        }

        for (int i = 0; i<range; i++){
            maxCount = Math.max(maxCount, times[i]);
        }

        int minD = n+1;
        int s = 0;
        int e = 0;

        for (int i=1; i<range; i++){
            if (times[i] == maxCount){
                if (end[i] - start[i] < minD){
                    minD = end[i] - start[i];
                    s = start[i];
                    e = end[i];
                }
            }
        }

        out.print(s + " " + e);

    }


    public void run() {
        try {
            in = new FastScanner();
            out = new PrintWriter(System.out);
            solve();
            out.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private class FastScanner {
        private BufferedReader br;
        private StringTokenizer st;

        public FastScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

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

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

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

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

        public BigInteger nextBigInteger() { return new BigInteger(next());}

    }

    public static void main(String[] arg) {
        new cf_312_b().run();
    }
}

class cf_312_arr implements Comparable<cf_312_arr>{
    int start;
    int end;
    int duration;
    public cf_312_arr(int start, int end){
        this.start = start;
        this.end = end;
        this.duration = end-start+1;
    }

    public int compareTo(cf_312_arr obj){
        return this.duration - obj.duration;
    }

}