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();
        }
        HashMap<Integer, Integer> counter = new HashMap<Integer, Integer>();
        // your code goes here
        for(int i = 0; i < n; i++) {
            if (counter.containsKey(types[i])) {
                counter.put(types[i], counter.get(types[i])+1);
            } else {
                counter.put(types[i], 1);
            }
        }
        int max = 0;
        int id = 1;
        for(Map.Entry<Integer, Integer> entry: counter.entrySet()) {
            Integer key = entry.getKey();
            Integer value = entry.getValue();
            if (value > max) {
                max = value;
                id = key;
            }
        }
        System.out.println(id);
    }
}