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

public class ez {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		FS in = new FS(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int n = in.nextInt();
		HashMap<Integer, Integer> starts = new HashMap<Integer, Integer>();
		HashMap<Integer, Integer> ends = new HashMap<Integer, Integer>();
		HashMap<Integer, Integer> counts = new HashMap<Integer, Integer>();
		for(int i =0; i <n; i++){
			Integer cur = in.nextInt();
			if(!counts.containsKey(cur)){
				counts.put(cur, 0);
				starts.put(cur, i+1);
			}
			counts.put(cur, counts.get(cur)+1);
			ends.put(cur, i+1);
		}
		int bestcount = 0;
		int bestval = 0;
		int bestwidth = Integer.MAX_VALUE;
		for(Integer i : counts.keySet()){
			if(counts.get(i)>bestcount){
				bestwidth = ends.get(i)-starts.get(i);
				bestval = i;
				bestcount = counts.get(i);
			}
			if(counts.get(i)==bestcount){
				if(ends.get(i)-starts.get(i)<bestwidth){
					bestval = i;
					bestwidth = ends.get(i)-starts.get(i);
				}
			}
		}
		System.out.println(starts.get(bestval)+" "+ends.get(bestval));
		out.close();
	}

	private static class Item implements Comparable<Item> {
		int a;
		int b;

		public Item(int a, int b) {
			this.a = a;
			this.b = b;
		}

		@Override
		public int compareTo(Item arg0) {
			// TODO Auto-generated method stub
			return Integer.compare(a - b, arg0.a - arg0.b);
		}

	}

	private static class FS {
		BufferedReader br;
		StringTokenizer st;

		public FS(InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

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

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

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

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

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}
}