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> counter = new HashMap<>();
        for (int type : types) {
            counter.putIfAbsent(type, 0);
            counter.merge(type, 1, Integer::sum);
        }

        counter.entrySet().stream().sorted(Map.Entry.comparingByValue(Comparator.reverseOrder()))
                .findFirst().ifPresent(x -> System.out.println(x.getKey()));
    }
}