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) {
        int t, i, key;
         TreeMap<Integer, Integer> myMap = new TreeMap<Integer, Integer>();
         Scanner sc = new Scanner(System.in);
         
         t = sc.nextInt();
         for(i=0;i<t;i++) {
             key = sc.nextInt();
             Integer check = myMap.get(key);
             if(check == null) {
                 myMap.put(key, new Integer(1));
             } else {
                 myMap.put(key, check+1);
             }
         }
         
         int max = 0, result = 0;
         for(Map.Entry m : myMap.entrySet()) {
             int val = ((Integer) m.getValue()).intValue();
             int k = ((Integer) m.getKey()).intValue();
             if(val > max) {
                 max = val;
                 result = k;
             }
         }
         
         System.out.println(result);
    }
}