Translation

A simple translation program translates texts between two languages, call them $A$ and $B$. The program translates a text word by word using a dictionary. To translate a word, it finds the first occurrence of that word in the dictionary and translates it accordingly.

If you translate a text from $A$ to $B$ with this program and then back to $A$, you may not get the same text. In this problem you repeat the procedure until the text no longer changes. Specifically:

1. Let $a$ be a text (a sequence of words) in language $A$.
2. Translate $a$ from $A$ to $B$, and call the new text $b$.
3. Translate $b$ from $B$ to $A$, and call the new text $a'$.
4. If $a \neq a'$, start over from step 1 with $a'$. Otherwise the text is fully translated.

Given a dictionary and a text, print the text produced by the algorithm above.

The first line contains an integer $N$ ($1 \leq N \leq 50\,000$), the number of words in the dictionary.

The next $N$ lines each contain two words, with no spaces inside a word. Each word contains only the characters a-z and is at most 20 characters long. The first word is in language $A$ and the second is in language $B$.

The next line contains an integer $M$ ($1 \leq M \leq 100\,000$), the number of words in the text to translate. The last line contains the text, a sequence of words separated by spaces. It is guaranteed that every word in the text appears in the dictionary.

Print one line: the text produced by the algorithm once it is finished.

The algorithm translates the sentence in the following steps:

1. programmering ar valdigt roligt
2. programmering ar valdigt skoj
3. programmering ar valdigt kul