import math
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

n = I()
l = LI()
l.sort(reverse=True)
d = {}

for i in range(n):
    if l[i] in d:
        d[l[i]] += 1
    else:
        d[l[i]] = 1

d_sorted = sorted(d.items(), key=lambda x: x[1], reverse=True)

print(max(d, key=d.get))