C. Circulating Misinformation
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

Colonel Tree, one of the most renowned teachers at the Institute of Meticulous Engineering, commonly referred to as IME, is currently facing a rather serious conundrum: he has been given a student list with names he doesn't recognize! Luckily, he somehow remembers the original names of the students, and so he must figure out potential students who could have altered his list. He decides that they'll be those whose names appear incorrectly in the list given to him. When a student has supposedly altered a name, they'll swap some characters around, remove some, or even add some. Of course, there are no students whose names are the same, and if a student edits a name on the list, they make sure that it won't conflict with any other name on the list.

However, since his wife has decided that he has been spending too much time in the institute babbling about computers, he has to leave and has chosen you to help him out. Once he comes back to the institute, he'd like to know the names of the suspects! Given both the original list and the altered one, help him out, please!

Input

The first line contains an integer $$$n$$$, $$$(1 \leq n \leq 10^4)$$$ — the number of students in the list.

Each of the next $$$n$$$ lines will contain a string $$$s$$$ $$$(3 \leq |s| \leq 30)$$$ — the name of the students in the list.

Each of the next $$$n$$$ lines will contain a string $$$s$$$ $$$(3 \leq |s| \leq 30)$$$ — the names present on the altered list.

These strings will contain only lowercase letters of the English alphabet and may contain spaces only between letters.

Output

Output the number $$$k$$$ — the number of students that are potential suspects.

On each of the next $$$k$$$ lines, print the original names of the suspected students. You must print these names in lexicographical order and they need to be separated by a line, as Colonel Tree likes to be very organized with his stuff.

A string $$$a$$$ is lexicographically smaller than a string $$$b$$$ if and only if one of the following holds:

  • $$$a$$$ is a prefix of $$$b$$$, but $$$a \neq b$$$.
  • In the first position where $$$a$$$ and $$$b$$$ differ, the string $$$a$$$ has a letter that appears earlier in the alphabet than the corresponding letter of $$$b$$$.
Example
Input
6
pedro bulcao
joao camelo
ebert henrique
laxe
calheiros
ivo lin
ivo lin
kemell
ebert balao
pedro balcao
laxs
carvalheiros
Output
5
calheiros
ebert henrique
joao camelo
laxe
pedro bulcao