import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] types = new int[n];
        for(int types_i=0; types_i < n; types_i++){
            types[types_i] = in.nextInt();
        }        int  max=0,minId=Integer.MAX_VALUE;
	        Hashtable<Integer,Integer> typesById= new Hashtable<Integer,Integer>();
	       
	        for(int i: types)
	        	if(typesById.containsKey(i))
	        		typesById.put(i, typesById.get(i)+1);
	        	else
	        		typesById.put(i, 1);
	        
	        
	        for(Integer id: typesById.keySet())
	        	if(max<typesById.get(id))
	        		max=typesById.get(id);
	        		
	        
	        for(Integer id: typesById.keySet())
	        	if(max==typesById.get(id))
	        		minId=minId>id?id:minId;
                
                   System.out.println(minId );
    }
}