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];
        Map<Integer, Integer> birdMap = new TreeMap<>();
        
        for(int types_i=0; types_i < n; types_i++){
            types[types_i] = in.nextInt();
            if(birdMap.containsKey(types[types_i])){
                birdMap.put(types[types_i], birdMap.get(types[types_i])+1);
            }else{
                birdMap.put(types[types_i], 1);
            }
        }
        
        //Collections.sort(birdMap);
        Iterator<Integer> keyIt = birdMap.keySet().iterator();
        int max = 0;
        int key = 0;
        while(keyIt.hasNext()){
            int number = keyIt.next();
            if(birdMap.get(number)>max){
                key = number;
                max = birdMap.get(number);
            }
        }
        
        System.out.print(key);
        // your code goes here
    }
}