Rock is an ICT teacher, one day, he realized that the number of students taking ICT suddenly increased, maybe some students decided to un-drop the subject. However, Rock thinks this is very suspicious and asks you to identify the imposters in his class.
Input
The first line consists of an integer $N$ $(1 \leq N \leq 1000)$.
The next line consists of $N$ strings of only letters.
Output
Output the imposters in the order they appear or sus
if there are none.
Sample Test Cases
Input | Output | |
---|---|---|
5 Jan Sunny Dragon Kodi Rock |
Kodi | |
5 Rock Sunny Jan Dragon Kodi |
Jan | |
6 Felix Bosco Jan Rock Sunny Dragon |
Jan Rock Sunny Dragon | |
3 Dragon Kodi Rock |
sus |
Scoring: Per Subtask
Authored by hclee and s19x17
Appeared in 中國香港九龍華仁書院電腦科主任李海峻老師精心調製之全校青少年信息學奧林匹克七月愚人節編程競賽二零二四