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

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();
        }
        // your code goes here
        
        HashMap<Integer,Integer> mymap=new HashMap<>();
        for(int i=0;i<types.length;i++){
            if(mymap.get(types[i])==null){
                mymap.put(types[i],1);
            }
            else
                mymap.put(types[i],mymap.get(types[i])+1);
        }
        Set<Entry<Integer,Integer>> myset=mymap.entrySet();
       // for(Object s:myset)
        //    System.out.println()
        List<Entry<Integer,Integer>> mylist=new ArrayList<>(myset);
        Collections.sort(mylist,new Comparator<Map.Entry<Integer,Integer>>()
                         {public int compare(Map.Entry<Integer,Integer> o1, Map.Entry<Integer,Integer> o2){
                             if(o1.getValue()>o2.getValue())
                                 return -1;
                             //else if(o1.getValue()<o2.getValue())
                             //    return -1;
                             else if (o1.getValue().equals(o2.getValue()))
                                 return o1.getKey().compareTo(o2.getKey());
                                 else 
                                 return 1;
                          }
                         }
                        );
        System.out.print(mylist.get(0).getKey());
    }
}