You are given ~N~ numbers, ~a_1, a_2, \ldots , a_N~. Output all the modes of this list on a single line from least to greatest. The mode of a list is/are the value(s) that appear(s) the most times relative to the other values in the list. It is guaranteed that at least one mode exists.
In all tests,
~1 \le N \le 10^6~
~-10^5 \le a_i \le 10^5~
The first line contains one number, ~N~.
The second line contains ~N~ spaced integers, ~a_i~, the numbers in this list.
On one line, output the modes of the ~N~ numbers in increasing order.
10 9 2 9 6 8 7 1 3 9 6