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;
			if (map.containsKey(types[i])) {
				count = map.get(types[i]);
				count++;
			} else {
				count = 1;
			}
			map.put(types[i], count);
		}
		int maxValueInMap = (Collections.max(map.values()));
		int result = 0;
		for (int key : map.keySet()) {
			if (map.get(key) == maxValueInMap) {
				result = key;
				break;
			}
		}
		System.out.println(result);

		in.close();
    }
}