{"problem":{"name":"Poll","description":{"content":"We have $N$ voting papers. The $i$\\-th vote $(1 \\leq i \\leq N)$ has the string $S_i$ written on it. Print all strings that are written on the most number of votes, in lexicographical order.","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc155_c"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $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).\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$S_1$\n$:$\n$S_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc155_c","tags":[],"sample_group":[["7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet","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`."],["8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo","buffalo"],["7\nbass\nbass\nkick\nkick\nbass\nkick\nkick","kick"],["4\nushi\ntapu\nnichia\nkun","kun\nnichia\ntapu\nushi"]],"created_at":"2026-03-03 11:01:13"}}