B"Mishka's favourite experimental indie band has recently dropped a new album! Songs of that album share one gimmick. Each name s_i is one of the following types: Songs are numbered from 1 to n . It's guaranteed that the first song is always of type 1 . Vova is rather interested in the new album but he really doesn't have the time to listen to it entirely. Thus he asks Mishka some questions about it to determine if some song is worth listening to. Questions have the following format: Mishka doesn't question the purpose of that information, yet he struggles to provide it. Can you please help Mishka answer all Vova's questions? The first line contains a single integer n ( 1 <= n <= 4 cdot 10^5 ) -- the number of songs in the album. Each of the next n lines contains the desciption of the i -th song of the album in the following format: The next line contains a single integer m ( 1 <= m <= 4 cdot 10^5 ) -- the number of Vova's questions. Each of the next m lines contains the desciption of the j -th Vova's question in the following format: It's guaranteed that the total length of question strings t doesn't exceed 4 cdot 10^5 . For each question print a single integer -- the number of occurrences of the question string t in the name of the i -th song of the album as a continuous substring. Song names of the first example: Thus the occurrences for each question string are: "...