Recently, Valery have come across an entirely new programming language. Most of all the language attracted him with template functions and procedures. Let us remind you that templates are tools of a language, designed to encode generic algorithms, without reference to some parameters (e.g., data types, buffer sizes, default values). Valery decided to examine template procedures in this language in more detail. The description of a template procedure consists of the procedure name and the list of its parameter types. The generic type T parameters can be used as parameters of template procedures. A procedure call consists of a procedure name and a list of variable parameters. Let's call a procedure suitable for this call if the following conditions are fulfilled: its name equals to the name of the called procedure; the number of its parameters equals to the number of parameters of the procedure call; the types of variables in the procedure call match the corresponding types of its parameters. The variable type matches the type of a parameter if the parameter has a generic type T or the type of the variable and the parameter are the same. You are given a description of some set of template procedures. You are also given a list of variables used in the program, as well as direct procedure calls that use the described variables. For each call you need to count the number of procedures that are suitable for this call. The first line contains a single integer n ( 1 ≤ n ≤ 1000 ) — the number of template procedures. The next n lines contain the description of the procedures specified in the following format: " void procedureName (type_1, type_2, ..., type_t) " ( 1 ≤ t ≤ 5 ), where void is the keyword, procedureName is the procedure name, type_i is the type of the next parameter. Types of language parameters can be " int ", " string ", " double ", and the keyword " T ", which denotes the generic type. The next line contains a single integer m ( 1 ≤ m ≤ 1000 ) — the