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;
        int ans = 0;
        for(int i = 0; i < types.length; i++){
            int count = 1;
            for(int x = i+1; x < types.length; x++){
                if(types[x] == types[i]){
                    count++;
                }
                else{
                    i=x-1;
                    break;
                } 
            }
            if(count > maxCount){
                maxCount = count;
                ans = types[i];
            }
        }
        System.out.println(ans);
    }
}