Prefix Query Count

Given $n$ pattern strings $s_1, s_2, \dots, s_n$ and $q$ queries, each query provides a text string $t$. For each query, count the number of strings among $\{s_1, s_2, \dots, s_n\}$ for which $t$ is a prefix.

A string $t$ is a prefix of a string $s$ if and only if after deleting some (possibly zero) characters from the end of $s$, the string becomes $t$. The input is case sensitive.

inputFormat

The first line contains an integer $n$, the number of pattern strings.

The following $n$ lines each contain a non-empty pattern string.

The next line contains an integer $q$, the number of queries.

The next $q$ lines each contain a query string $t$.

outputFormat

For each query, output on a new line the count of pattern strings that have the query string as a prefix.

sample

5
apple
application
apricot
banana
band
3
app
ban
z

2
2
0