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];
        
        int cnt = 0;
        Map<Integer,Integer> m = new HashMap<Integer,Integer>();
        
        for(int types_i=0; types_i < n; types_i++){
            types[types_i] = in.nextInt();
        }
        
         for(int i=0; i < n; i++){
            
            if (m.containsKey(types[i])) {                
                cnt = m.get(types[i]) + 1;
                m.put(types[i],cnt);
            } else {
                m.put(types[i],1);
            }
        }
       
        Iterator<Integer> it = m.keySet().iterator();
        Integer fk = it.next();
        Integer max = m.get(fk);
        Integer res = 0;
        Integer pk = fk;
        
        while(it.hasNext()) {
        Integer k = it.next();
        pk = k;    
        Integer val = m.get(k);
        if (val > max){
         max = val;
         fk=k;           
        } else if (max == val){
            res = (fk > pk) ?pk:fk;
        }
            
        }
        
        System.out.print(fk);
    }
}