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();
        }
        int largestCount = 0;
        int largestType = 0;
        Map<Integer, Integer> countMap = new TreeMap<Integer, Integer>();        
        for(int type : types){
            if(countMap.containsKey(type)){
                int count =  countMap.get(type);
                count++;
                countMap.put(type, count);
                if(count > largestCount){
                    largestCount = count;
                    largestType = type;
                }else if(count == largestCount && type < largestType){
                    largestType = type;
                }
            }else{
                int count =  0;
                count++;
                countMap.put(type, count);
                if(count > largestCount){
                    largestCount = count;
                    largestType = type;
                }else if(count == largestCount && type < largestType){
                    largestType = type;
                }
            }
        }
        System.out.println(largestType);
    }
}