|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||0||0||0||0.000%|
Suppose there are a number of good users using an Internet chat room, which is a shared text chat space. Now there are some bad guys in the Internet who would come to this room and would have no respect or interest in the topic of discussion in the group. They would start typing strings of garbage characters, start unsolicited advertisements of certain URLs or businesses, or paste same string again and again just to disturb others in the room.
When I asked about this problem to Prof Banku (naturally not as smart as Prof Shanku) he suggested the following scheme. Let us define consonants to be all letters in a-z and A-Z except a, e, i, o, u, y, A, E, I, O, U and Y.
A user should be able to send a line to the chat room unless
Input consists of several lines. The first line contains an integer n, which is the number of lines in the shared text space. Then follow n lines each consisting of not more than 255 ASCII characters.
For each line of input print y if the line is acceptable according to the criteria set above and n otherwise in separate lines. See the sample output for example.
12 hello how r u? where r u from? kjhh kh kgkjhg jhg where r u from? i am from London, Ontario, Canada how r you nxw? now where r u from? kjhh kh kgkjhg jhg very good it is very cold here.
y y y n y y y y n n y y