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();
        TreeMap<Integer, Integer> tm=new TreeMap<Integer,Integer>();
        int val;
        int types[]=new int[n];
        for(int types_i=0; types_i < n; types_i++){
        	val=1;
            types[types_i] = in.nextInt();
            if(tm.containsKey(types[types_i])){
            	val=tm.get(types[types_i]);
            	val++;
            }
            tm.put(types[types_i], val);     
        }
        int max=tm.get(1),pos=1;
        
        for(Integer i:tm.keySet()){
        	if(tm.get(i)>max){
        		max=tm.get(i);pos=i;
        	}
        	else if(tm.get(i)==max){
        		if(i<pos)pos=i;
        	}
        }
        
        System.out.println(pos);
        // your code goes here
    }
}