Cards

Jungyu has $N$ number cards. Each card has one integer written on it, and that integer is at least $-2^{62}$ and at most $2^{62}$.

Given the cards Jungyu holds, write a program that finds the integer he holds the most copies of. If several integers are tied for the largest count, print the smallest of them.

The first line contains the number of cards $N$ ($1 \le N \le 100{,}000$). Each of the next $N$ lines contains one integer written on a card.

Print the integer that Jungyu holds the most copies of.