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.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;
import java.io.BufferedWriter;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.Arrays;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.IOException;
/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author Alex
 */
public class Main{
	public static void main(String[] args){
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		OutputWriter out = new OutputWriter(outputStream);
		TaskB solver = new TaskB();
		solver.solve(1, in, out);
		out.close();
	}
	static class TaskB{
		public void solve(int testNumber, InputReader in, OutputWriter out){
			int n = in.ri(), MAXVAL = 1_000_009;
			int[] a = IOUtils.readIntArray(in, n);
			int[] leftmost = new int[MAXVAL], rightmost = new int[MAXVAL];
			int[] count = new int[MAXVAL];
			Arrays.fill(leftmost, MAXVAL);
			Arrays.fill(rightmost, -2);
			for(int i = 0; i < n; i++) {
				leftmost[a[i]] = Math.min(leftmost[a[i]], i);
				rightmost[a[i]] = Math.max(rightmost[a[i]], i);
				count[a[i]]++;
			}
			int maxcount = ArrayUtils.maxElement(count);
			int res = Integer.MAX_VALUE, leftres = -1, rightres = -1;
			for(int i = 0; i < MAXVAL; i++) {
				if(count[i] == maxcount){
					int diff = Math.max(0, rightmost[i] - leftmost[i]);
					if(diff < res){
						res = diff;
						leftres = leftmost[i];
						rightres = rightmost[i];
					}
				}
			}
			out.printLine(leftres + 1, rightres + 1);
		}
	}
	static class OutputWriter{
		private final PrintWriter writer;
		public OutputWriter(OutputStream outputStream){
			writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
		}
		public OutputWriter(Writer writer){
			this.writer = new PrintWriter(writer);
		}
		public void print(Object... objects){
			for(int i = 0; i < objects.length; i++) {
				if(i != 0)
					writer.print(' ');
				writer.print(objects[i]);
			}
		}
		public void printLine(Object... objects){
			print(objects);
			writer.println();
		}
		public void close(){
			writer.close();
		}
	}
	static class ArrayUtils{
		public static int maxElement(int[] array){
			return maxElement(array, 0, array.length);
		}
		public static int maxElement(int[] array, int from, int to){
			int result = Integer.MIN_VALUE;
			for(int i = from; i < to; i++)
				result = Math.max(result, array[i]);
			return result;
		}
	}
	static class IOUtils{
		public static int[] readIntArray(InputReader in, int size){
			int[] array = new int[size];
			for(int i = 0; i < size; i++)
				array[i] = in.readInt();
			return array;
		}
	}
	static class InputReader{
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;
		private InputReader.SpaceCharFilter filter;
		public InputReader(InputStream stream){
			this.stream = stream;
		}
		public int read(){
			if(numChars == -1)
				throw new InputMismatchException();
			if(curChar >= numChars){
				curChar = 0;
				try{
					numChars = stream.read(buf);
				} catch(IOException e){
					throw new InputMismatchException();
				}
				if(numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
		public int ri(){
			return readInt();
		}
		public int readInt(){
			int c = read();
			while(isSpaceChar(c))
				c = read();
			int sgn = 1;
			if(c == '-'){
				sgn = -1;
				c = read();
			}
			int res = 0;
			do{
				if(c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			} while(!isSpaceChar(c));
			return res * sgn;
		}
		public boolean isSpaceChar(int c){
			if(filter != null)
				return filter.isSpaceChar(c);
			return isWhitespace(c);
		}
		public static boolean isWhitespace(int c){
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
		public interface SpaceCharFilter{
			public boolean isSpaceChar(int ch);
		}
	}
}