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> repetitions = new HashMap<Integer, Integer>();
       

  for (int i = 0; i < n; i++) {
      int item = types[i];
      
      if (repetitions.containsKey(item))
          repetitions.put(item, repetitions.get(item) + 1);
      else
          repetitions.put(item, 1);
  }
        List<Integer> mapValues = new ArrayList<>(repetitions.values());
        List<Integer> maximum=new ArrayList();

          Collections.sort(mapValues);
        int max=mapValues.get(mapValues.size()-1);
        for(Map.Entry<Integer,Integer> map:repetitions.entrySet()){
            if(map.getValue() == max){
               maximum.add(map.getKey());
                 
               
            }
            
        }
        
            if(maximum.size() ==1){
                System.out.println(maximum.get(0));
            }
            else{
                Collections.sort(maximum);
                System.out.println(maximum.get(0));
            }
        }
        
           
           
        
        }