A community ham-radio registry keeps a list of station call-names. To save airtime during drills, operators refer to a station by a short fingerprint instead of spelling it out: if the call-name has one or two letters, its fingerprint is the call-name itself; otherwise the fingerprint is formed by the call-name's first letter, followed by the number of letters strictly between the first and the last letter, followed by the last letter (so a ten-letter call-name beginning with 'c' and ending with 'd' becomes 'c8d'). Because two different call-names can accidentally reduce to the same fingerprint, an operator wants to know, for a list of lookup call-names, whether each one can be used safely — that is, whether every registry entry sharing its fingerprint is in fact the very same call-name (so no other, different call-name is hiding behind that fingerprint). The registry itself may list the same call-name more than once; repeats of a lookup's own call-name never make it unsafe.

Input format

• Line 1: an integer n, the number of entries in the registry.
• The next n lines: one registry call-name each, consisting only of lowercase English letters.
• The next line: an integer q, the number of lookup call-names.
• The next q lines: one lookup call-name each, consisting only of lowercase English letters.

Output format

• q lines. Line i must be true if the fingerprint of the i-th lookup call-name is safe to use as defined above, or false otherwise.

Constraints

• 1 <= n <= 1000
• 1 <= q <= 1000
• 1 <= length of every call-name <= 20
• Every call-name (registry and lookup) consists only of lowercase English letters 'a'-'z'.

4
deer
door
cake
card
2
dear
cart

false
true

3
cake
cane
bb
2
cane
bb

false
true