Poll

AtCoder

IDabc155_c

Time2000ms

Memory256MB

Difficulty—

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. ## Constraints * $1 \leq N \leq 2 \times 10^5$ * $S_i$ $(1 \leq i \leq N)$ are strings consisting of lowercase English letters. * The length of $S_i$ $(1 \leq i \leq N)$ is between $1$ and $10$ (inclusive). ## Input Input is given from Standard Input in the following format: $N$ $S_1$ $:$ $S_N$ [samples]

Samples

Input #1

7
beat
vet
beet
bed
vet
bet
beet

Output #1

beet
vet

`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`.

Input #2

8
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo

Output #2

buffalo

Input #3

7
bass
bass
kick
kick
bass
kick
kick

Output #3

kick

Input #4

4
ushi
tapu
nichia
kun

Output #4

kun
nichia
tapu
ushi

API Response (JSON)

{
  "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## Constr...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments