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> birdMap = new HashMap<>();
        int birdCount = 0;
        
        for(int i=0;i<types.length;i++){
            if(!birdMap.containsKey(types[i])){
                birdMap.put(types[i], 1);
            }else{
                birdCount = birdMap.get(types[i]);
                birdCount++;
                birdMap.put(types[i], birdCount);
            }
        }
        
        int maxBirdCount = 0;
        int maxBirdId = 0;
        
        for(Integer birdId : birdMap.keySet()) {
            birdCount = birdMap.get(birdId);
            
            if( birdCount > maxBirdCount){
                maxBirdId = birdId;
                maxBirdCount = birdCount;
            }
        }
        
        System.out.println(maxBirdId);
        
        // your code goes here
    }
}