Doraemon is planning a trip to Hsinchu and visiting the best university in Taiwan, the National Tsing Hua University. Unfortunately, after Doraemon arrives, what he wouldn't expect is it seems that all the building there is under construction! He discovers it has signs everywhere saying "Build Up Tsing Hua in the future". Therefore, Doraemon decides to see the real Tsing Hua by himself, so he takes the time machine to go to the future and see the beautiful campus in person.
Unfortunately, he discovers that it must have at least one place is under construction for every moment in NTHU, so he decides to count how many different construction projects he can see, and record them in his note.
In this problem, please notice the following description:
<name of place 1>: <comment for place 1>, <name of place 2>: <comment for place 2>, ..., <name of place n>: <comment for place n>
"<name of place x>
and <comment for place x>
consist of lower-case and upper-case alphabets A-Z/a-z
, dash -
, parenthesis ()
, spaces
, and periods .
, and both of them won't be empty strings.under construction
" (case-insensitive), it means that the corresponding place is still being constructed. Hint. You may use some string-related function to deal with this problem, this is the reference of some functions that might be helpful.
The input contains several lines and ends with EOF (end of file).
Test case constraints
<name of place x>
and <comment for place x>
is at most 30.
For each place that is under construction, output one line contains the name of the places. Remember not to output the duplicate one.