import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque, OrderedDict
from copy import deepcopy

n = int(input()) 
a = list(map(int, input().split()))
l = defaultdict(int)
for aa in a:
  l[aa] += 1
print(sorted(dict(l).items(), key=lambda x:x[1])[-1][0])