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];
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        
        for(int types_i=0; types_i < n; types_i++){
            types[types_i] = in.nextInt();
            if (map.containsKey( types[types_i])){
                map.put( types[types_i], map.get( types[types_i])+1);
            } else {
                map.put( types[types_i], 1);
            }
        }
        
        int max = 0;
        int maxKey = 0;
        
        for (int num: map.keySet()) {
            if (map.get(num) > max) {
                maxKey = num;
                max = map.get(num);
            }
        }
        
        System.out.println(maxKey);
        
    }
}