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();
        }
        // your code goes here
        HashMap<Integer, Integer> hm=new HashMap<Integer,Integer>();
	     //ArrayList<Integer> al=new ArrayList<Integer>();
	     for(int i=0;i<types.length;i++)
	     {
	    	if(hm.containsKey(types[i]))
	    	{
	    		hm.put(types[i], hm.get(types[i])+1);
	    	}
	    	else
	    	{
	    		hm.put(types[i],1);
	    	}
	     }
	     int maxCount=0;
	     int birdType=0;
	     for(Map.Entry<Integer, Integer> entry:hm.entrySet())
	     {
	    	// System.out.println(entry.getKey()+" : "+entry.getValue());
	    	 if(entry.getValue()>maxCount)
	    	 {
	    		 maxCount=entry.getValue();
	    		 birdType=entry.getKey();
	    	 }
	     }
	     System.out.println(birdType);
	     in.close();
    }
}