{"raw_statement":[{"iden":"problem statement","content":"We have $N$ voting papers. The $i$\\-th vote $(1 \\leq i \\leq N)$ has the string $S_i$ written on it.\nPrint all strings that are written on the most number of votes, in lexicographical order."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $S_i$ $(1 \\leq i \\leq N)$ are strings consisting of lowercase English letters.\n*   The length of $S_i$ $(1 \\leq i \\leq N)$ is between $1$ and $10$ (inclusive)."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$S_1$\n$:$\n$S_N$"},{"iden":"sample input 1","content":"7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet"},{"iden":"sample output 1","content":"beet\nvet\n\n`beet` and `vet` are written on two sheets each, while `beat`, `bed`, and `bet` are written on one vote each. Thus, we should print the strings `beet` and `vet`."},{"iden":"sample input 2","content":"8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo"},{"iden":"sample output 2","content":"buffalo"},{"iden":"sample input 3","content":"7\nbass\nbass\nkick\nkick\nbass\nkick\nkick"},{"iden":"sample output 3","content":"kick"},{"iden":"sample input 4","content":"4\nushi\ntapu\nnichia\nkun"},{"iden":"sample output 4","content":"kun\nnichia\ntapu\nushi"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}