Attendance

문제

Taking attendance in your class is a tedious task. You call out the names of students one at a time in alphabetical order. If the student is present, they respond by saying "Present!" before you call the next name.

This is such a boring task that you sometimes zone out and don't keep a proper record of attendance. Write a program to help you summarize the absences!

입력

The first line of input contains a single integer $NN$ $(1\le N\le 200)(1\; \backslash leq\; N\; \backslash leq\; 200)$ indicating the number of "callouts". Then $NN$ lines follow indicating the callouts that were made in the order they were made. A single line consists of either a student's name or of the response Present!. A student's name will consist of between $22$ and $1010$ characters, the first always being an uppercase letter ('A'-'Z') and the remaining characters always being lowercase letters ('a'-'z').

The student names will appear in alphabetical order in this input and a line with the response Present! will only appear if the previous line was the name of a student. In particular, the response Present! will never appear as the first callout.

출력

Output the names of all students that are absent in the order they were called, each on a separate line. If no students were absent, simply output the message No Absences