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
        int maxCount =1;
        int birdType =0;
        int count=0;
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        for(int i=0; i<types.length; i++){
          if(map.get(types[i]) != null){
				count =map.get(types[i])+1;
				map.put(types[i], count);
			}else{
				map.put(types[i], 1);
			}
        }
        
        for(Entry<Integer, Integer> entry : map.entrySet()) {
	            if(entry.getValue() > maxCount){
	                maxCount = entry.getValue();
	                birdType = entry.getKey();
	            }else if(entry.getValue() == maxCount){
	                if(entry.getKey() < birdType){
	                     birdType = entry.getKey();
	                }
	            }
	        }
	        
	        System.out.println(birdType);
    }
}