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.util.ArrayList;
import java.util.Scanner;
public class S_2 {
    public static void main(String args[]){
        
        
        
        Scanner input=new Scanner(System.in);
        
        
        int n=input.nextInt();
        
        int b[]=new int[n];
        int a[]=new int[1000005];//freq of element
        int st[]=new int[1000005];//strting index
        int end[]=new int[1000005];//ending index
        int prev=0;
        ArrayList<Integer> list=new ArrayList<Integer>();
        int max=0;
        
        for(int i=0;i<n;i++)
        {
            int temp=input.nextInt();
            
            b[i]=temp;
            
            if(a[temp]==0)
            {
                st[temp]=i;
                end[temp]=i;
            }
            
            else
                end[temp]=i;
            
            a[temp]++;
            
            if(a[temp]>max)
                max=a[temp];//find the max. freq.
            
        }
        
        
        long min=Long.MAX_VALUE;
        int ans=0;
        for(int i=1;i<1000001;i++)
        {
            if(a[i]==max)
            {
                if(end[i]-st[i]<min)
                {
                    min=end[i]-st[i];
                    ans=i;
                }
                
                //list.add(i);//add all elements having max freq. in list
            }
        }
        System.out.println((st[ans]+1)+" "+(end[ans]+1));//print the index
        
        
    }

}