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 + 1]; Map map = new HashMap<>(); for(int types_i=0; types_i < n; types_i++){ int t = in.nextInt(); types[t] = types[t] + 1; } int index = 0; int max = Integer.MIN_VALUE; for (int i = 0; i < n + 1; i++) { if (types[i] > max) { max = types[i]; index = i; } } System.out.println(index); } }