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();
        }
        
        int[] typesTalley = new int[n];
        
        for (int i = 0; i < n; i++) {
            int j = types[i] - 1;
            typesTalley[j] = typesTalley[j] + 1;
        }
        
        int max = typesTalley[0];
        int bird = 1;
        
        for (int k = 1; k < n; k++) {
            if (typesTalley[k] > max) {
                max = typesTalley[k];
                bird = k + 1;
            }
        }
        
        System.out.println(bird + "");
        
    }
}