Choosing the Morgorithm President

Taeyun, the president of Morgorithm, is choosing the person who will lead Morgorithm in 2024. Nobody wants the job, so Taeyun picks the president himself. He plans to choose the person who comes first in dictionary order among those whose names have exactly three characters.

Every name is different and consists of uppercase letters A - Z, with a length from $2$ to $5$.

Name $S$ comes before name $T$ in dictionary order if and only if one of the following holds. Here $|S|$ is the length of $S$, and $S[i]$ is the $i$-th character of $S$.

• $S$ is a prefix of $T$. That is, $|S| < |T|$, and $S[i] = T[i]$ for every $1 \leq i \leq |S|$.
• At the first index $i$ where $S[i] \neq T[i]$ (with $1 \leq i \leq \min(|S|, |T|)$), $S[i] < T[i]$.

Predict who will be chosen as president.

The first line contains $N$, the number of people.

The next $N$ lines contain the names $name_1$ through $name_N$.

Print the name of the person who will be chosen as president.

• $1 \leq N \leq 100\,000$
• $2 \leq |name_i| \leq 5$
• At least one person has a name of exactly three characters.
• Each name is given at most once.