Collection of words

Write a program to keep a collection of words. There are two instructions:

“AFEGEIX” $w$ adds the word $w$ to the collection, and prints nothing.
“SEGUENT” deletes the longest word of the collection, and prints it. In the event of a tie, it deletes the word that was added first.

Input

Input consists of a sequence of instructions. The given words are made up of only lowercase letters, and can be repeated.

Output

For every “SEGUENT” instruction, print a line with the required word according to the rules given above. You can assume that there will always be at least one word.

Observation

“Afegeix” is Catalan for “add”, and “següent” is Catalan for “next”.

Problem information

Author: Unknown
Translator: Salvador Roura

Generation: 2026-01-25T11:57:36.188Z