URI Online Judge | 2023

The Last Good Kid

By M.C. Pinto, UNILA BR Brazil

Timelimit: 1

Santa Claus classifies all the children of the world into two lists: the good ones and the naughty ones. He would like to know which of the children is the last in the good ones list, when sorting them in alphabetical order. To do that he asked his Cristhmas Elfs to write down all the good kids' names in a sheet of paper.

However, each elf wrote the names in a different way: first letter uppercase and then lowercase; all letters uppercase; all lowercase; and all kind of combinations between upper and lowercase letters.

Santa wants your help to tell which is the last name in the list given all the names of the good kids.

Input

The input has several lines. Each line has the name of one good kid. No elf wrote names with accented letters. The longest name is at most 80 characters long. There are no more than 1000 kids on the list. All the names are different. The names list ends with EOF.

Output

The output is given in one line. It consists of the name of the kid that should be at the last position of the good ones list. You must print the name exactly as it was read at the input. Use alphabetical order to sort the names, but do not differ letters because of its case.

Input Samples Output Samples

ana
Julio
gABRIEL
VANESSA
cArLoS

VANESSA

abraao
aRi
abelardo
amanda

aRi

Joaquim Jose da Silva Xavier
Pedro de Alcantara Joao Carlos Leopoldo Salvador Bibiano Francisco Xavier Miguel
Pedro de Alcantara Francisco Antonio Joao Carlos Xavier de Paula Miguel Cipriano
Pedro Raymundo

Pedro Raymundo