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();
        }
        HashMap<Integer,Integer> typeAndOccurance = new HashMap<>();
        // your code goes here

        for(int type: types){
            if(typeAndOccurance.get(type)!=null){
                typeAndOccurance.put(type, typeAndOccurance.get(type)+1);                
            }
            else{
                typeAndOccurance.put(type,1);
            }
        }
        Set<Integer> keyset = typeAndOccurance.keySet();
        int maxOccuranceType = types[0];
        for(int key: keyset){
            if((typeAndOccurance.get(key)>typeAndOccurance.get(maxOccuranceType)) || (typeAndOccurance.get(key)==typeAndOccurance.get(maxOccuranceType) && key<maxOccuranceType) ){
                maxOccuranceType = key;
            }
        }
        
        System.out.println(maxOccuranceType);
    }
}