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];
        Map<Integer, Integer> map=new TreeMap<Integer, Integer>();
        for(int types_i=0; types_i < n; types_i++){
            types[types_i] = in.nextInt();
            int key = types[types_i];
            if(map.containsKey(key)){
                map.put(key,map.get(key)+1);
            }else{
                map.put(key,1);
            }
    }
        //System.out.println(Collections.max(map.values()));
        int max=0;
		for (Map.Entry<Integer, Integer> entry : map.entrySet())
			if(entry.getValue()>max)
			{
				max=entry.getValue();
		}
		
		for (Map.Entry<Integer, Integer> entry : map.entrySet())
			if(entry.getValue()==max)
			{
				System.out.println(entry.getKey());
				break;
		}
}
}