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.math.BigInteger;
import java.util.*;

public class DAY1 {
		
	public static void main(String[] args) throws IOException {
		new DAY1().solve();
	}
	
	PrintWriter out;
	int n;
	int m;
	boolean[] use;
	int mod = 1000000007;
	int rv = 0;
	ArrayList<Integer>[] g;
	int[] res;
	int p, q;
	HashMap<Long, Long> map = new HashMap();
	void solve() throws IOException{
		Reader in = new Reader("input.txt");
		out = new PrintWriter( new BufferedWriter(new OutputStreamWriter(System.out)) );
		//out = new PrintWriter(new FileWriter(new File("output.txt"))); 
		
		int n = in.nextInt();
		int[] a = new int[n];
		int[] was = new int[1000001];
		int[] first = new int[1000001];
		int[] last = new int[1000001];
		
		int f = -1;
		int l = -1;
		
		for (int i = 0; i < n; i++) {
			int x = in.nextInt();
			was[x]++;
			a[i] = x;
			if (first[x] == 0)
				first[x] = i+1;
			last[x] = i+1;
		}
		
		int max = -1;
		int num = -1;
		
		for (int i = 0; i <= 1000000; i++) {
			if (was[i] > max) {
				max = was[i];
				num = i;
			}
			else
			if (was[i] == max && last[i]-first[i]+1<last[num]-first[num]+1)
			{
				max = was[i];
				num = i;
			}
		}
		
		out.print(first[num]+" "+last[num]);
		out.flush();
		out.close();
		
	}
	
	long pow(int x, int m) {
		if (m == 0)
			return 1;
		return x*pow(x, m-1);
	}
	
class Pair implements Comparable<Pair> {
		
		int a;
		int b;
		
		Pair (int a, int b) {
			this.a = a;
			this.b = b;
		}

		@Override
		public int compareTo(Pair p) {
			if (a < p.a)
				return -1;
			if (a > p.a)
				return 1;
			
			if (b < p.b)
				return -1;
			
			if (b > p.b)
				return 1;
			
			return 0;
		}
		
	}

	class Item implements Comparable<Item> {

		int a;
		int b;
		long u;
		
		Item(int v, int l, long z) {
			this.a = v;
			this.b = l;
			this.u = z;
		}
		
		@Override
		public int compareTo(Item item) {
			
			if (u > item.u)
				return 1;
			else
			if (u < item.u)
				return -1;
			else {
				return 0;
			}
						
		}
		
	}
	
	class Reader {
	    
	    StringTokenizer token;
	    BufferedReader in;
	    
	    public Reader(String file) throws IOException {
	        //in = new BufferedReader( new FileReader( file ) );
	       in = new BufferedReader( new InputStreamReader( System.in ) );
	    }
	    
	    public byte nextByte() throws IOException {
	        return Byte.parseByte(Next());
	    }
	    
	    public int nextInt() throws IOException {
	        return Integer.parseInt(Next());
	    }
	    
	    public long nextLong() throws IOException {
	        return Long.parseLong(Next());
	    }
	    
	    public String nextString() throws IOException {
	        return in.readLine();
	    }
	    
	    public String Next() throws IOException {
	        while (token == null || !token.hasMoreTokens()) {
	            token = new StringTokenizer(in.readLine());
	        }
	        return token.nextToken();
	    }

	    
	}
	
}