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

public class Solution {

    public static int mostCommon(int types[]){
        
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>(); 
        int n = types.length;
        
        for (int  i = 0 ; i < n ; ++i){
            
            Integer val = map.get(types[i]);
            if (val == null) val = 0;
            map.put(types[i],++val);
        }
        
        int max = types[0];
        int maxVal = map.get(types[0]);
        for (int  i = 1 ; i < n ; ++i){
            
            Integer val = map.get(types[i]);
            if (val > maxVal || (val == maxVal && max > types[i])){
                
                max= types[i];
                maxVal = val;
            }
        }
        
        return max;
    }
    
    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
        System.out.println(mostCommon(types));
    }
}