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