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 currRun = 1;
        int currValue = types[0];
        int maxRun = 1;
        int maxValue = types[0];
        for (int i = 1; i < types.length; i++) {
            if (types[i] == currValue) {
                currRun++;
            }
            else {
                if (currRun > maxRun) {
                    maxRun = currRun;
                    maxValue = currValue;
                }
                currRun = 1;
                currValue = types[i];                
            }
        }
        if (currRun > maxRun) {
            maxRun = currRun;
            maxValue = currValue;
        }
        System.out.println(maxValue);
    }
}