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();
        }
        Map<Integer,Integer> map = new HashMap<>();
        for(int i = 0; i < n; i++){
            if(map.containsKey(types[i])){
                map.put(types[i], map.get(types[i]) + 1);
            }else{
                map.put(types[i], 1);
            }
        }
        int max = 0;
        for(int i : map.values()){
            if(max < i){
                max = i;
            }
        }
        ArrayList<Integer> qw = new ArrayList<>();
         for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() == max) {
                qw.add(entry.getKey());
            }
        }
        Collections.sort(qw);
        System.out.println(qw.get(0));
    }
}