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();
        }
        // your code goes here
        Arrays.sort(types);
        int maxcount=1,count=1;
        int maxid=types[0];
        
        for(int i=1;i<n;i++){
            if(types[i]!=types[i-1]){
                if(count > maxcount){
                    maxcount=count;
                    maxid=types[i-1];
                }
                if(count==maxcount)
                    maxid= (maxid > types[i-1]? types[i-1]:maxid);
                count=1;
            }
            else
                count++;
         
        }
        if(count>maxcount)
            maxid=types[n-1];
         else if(count==maxcount)
            maxid= (maxid > types[n-1]? types[n-1]:maxid);
        
        System.out.println(maxid);
            
        
    }
}