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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.StringTokenizer;

public class CF312B {
	private FastScanner in;
	private PrintWriter out;

	public class Tuple {
		int a, b, c;
		
		Tuple(int a, int b, int c){
			this.a = a;
			this.b = b;
			this.c = c;
		}
	}
	
	public void solve() throws IOException {
		int n = in.nextInt();
		int[] ar = new int[n];
		for (int i = 0; i < n; i++){
			ar[i] = in.nextInt();
		}
		HashMap<Integer, Tuple> map = new HashMap<Integer, Tuple>();
		for (int i = 0; i < n; i++){
			if (map.get(ar[i]) == null){
				map.put(ar[i], new Tuple(i, i, 1));
			} else {
				Tuple orig = map.get(ar[i]);
				Tuple update = new Tuple(orig.a, i, orig.c+1);
				map.put(ar[i], update);
			}
		}
		int max = 0;
		int dist = 10000000;
		String ans = "";
		for (int i = 0; i < n; i++){
			int chk = map.get(ar[i]).b - map.get(ar[i]).a;
			int occ = map.get(ar[i]).c;
			if (occ > max){
				dist = chk;
				max = occ;
				ans = (map.get(ar[i]).a+1) + " " + (map.get(ar[i]).b+1);
			}
			else if (occ == max && chk < dist){
				dist = chk;
				max = occ;
				ans = (map.get(ar[i]).a+1) + " " + (map.get(ar[i]).b+1);
			}
		}
		out.println(ans);
	}

	public static void main(String[] args) {
		new CF312B().run();
	}

	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());
		}
	}
}