1207_G. Indie Album

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:

  * 1~c — a single lowercase Latin letter; 
  * 2~j~c — name s_j (1 ≤ j < i) with a single lowercase Latin letter appended to its end. 



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:

  * i~t — count the number of occurrences of string t in s_i (the name of the i-th song of the album) as a continuous substring, t consists only of lowercase Latin letters. 



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?

Input

The first line contains a single integer n (1 ≤ n ≤ 4 ⋅ 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:

  * 1~c — s_i is a single lowercase Latin letter; 
  * 2~j~c — s_i is the name s_j (1 ≤ j < i) with a single lowercase Latin letter appended to its end. 



The next line contains a single integer m (1 ≤ m ≤ 4 ⋅ 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:

  * i~t (1 ≤ i ≤ n, 1 ≤ |t| ≤ 4 ⋅ 10^5) — count the number of occurrences of string t in s_i (the name of the i-th song of the album) as a continuous substring, t consists only of lowercase Latin letters. 



It's guaranteed that the total length of question strings t doesn't exceed 4 ⋅ 10^5.

Output

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.

Example

Input


20
1 d
2 1 a
2 2 d
2 3 a
2 4 d
2 5 a
2 6 d
2 7 a
1 d
2 9 o
2 10 k
2 11 i
2 12 d
2 13 o
2 14 k
2 15 i
2 1 o
2 17 k
2 18 i
2 15 i
12
8 da
8 dada
8 ada
6 dada
3 dada
19 doki
19 ok
16 doki
15 doki
9 d
1 a
20 doki


Output


4
3
3
2
0
1
1
2
1
1
0
2

Note

Song names of the first example:

  1. d 
  2. da 
  3. dad 
  4. dada 
  5. dadad 
  6. dadada 
  7. dadadad 
  8. dadadada 
  9. d 
  10. do 
  11. dok 
  12. doki 
  13. dokid 
  14. dokido 
  15. dokidok 
  16. dokidoki 
  17. do 
  18. dok 
  19. doki 
  20. dokidoki 



Thus the occurrences for each question string are:

  1. string "da" starts in positions [1, 3, 5, 7] in the name "dadadada"; 
  2. string "dada" starts in positions [1, 3, 5] in the name "dadadada"; 
  3. string "ada" starts in positions [2, 4, 6] in the name "dadadada"; 
  4. string "dada" starts in positions [1, 3] in the name "dadada"; 
  5. no occurrences of string "dada" in the name "dad"; 
  6. string "doki" starts in position [1] in the name "doki"; 
  7. string "ok" starts in position [2] in the name "doki"; 
  8. string "doki" starts in positions [1, 5] in the name "dokidoki"; 
  9. string "doki" starts in position [1] in the name "dokidok"; 
  10. string "d" starts in position [1] in the name "d"; 
  11. no occurrences of string "a" in the name "d"; 
  12. string "doki" starts in positions [1, 5] in the name "dokidoki". 

Example input:
20
1 d
2 1 a
2 2 d
2 3 a
2 4 d
2 5 a
2 6 d
2 7 a
1 d
2 9 o
2 10 k
2 11 i
2 12 d
2 13 o
2 14 k
2 15 i
2 1 o
2 17 k
2 18 i
2 15 i
12
8 da
8 dada
8 ada
6 dada
3 dada
19 doki
19 ok
16 doki
15 doki
9 d
1 a
20 doki


Example output:
4
3
3
2
0
1
1
2
1
1
0
2


Tags: data structures
dfs and similar
hashing
string suffix structures
strings
trees
Difficulty rating: 2700

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 400005;
int nxt[N], tot, fi[N], zz[N], sl[N], ne[N][26], cnt, fail[N], x, opt, n, m,
    cnt2[N], ans[N], vis[N], id[N];
queue<int> q;
char s[N], c;
vector<int> G[N], v[N];
inline void jb(int x, int y, char c) {
  nxt[++tot] = fi[x];
  fi[x] = tot;
  zz[tot] = y;
  sl[tot] = c;
}
inline int insert(char s[]) {
  int p = 0;
  for (int i = 1; s[i]; i++) {
    int x = s[i] - 'a';
    if (!ne[p][x]) ne[p][x] = ++cnt;
    p = ne[p][x];
  }
  vis[p] = 1;
  return p;
}
inline void build_fail() {
  q.push(0);
  while (!q.empty()) {
    int x = q.front();
    q.pop();
    for (int i = 0; i < 26; i++)
      if (ne[x][i]) {
        int t = ne[x][i];
        if (x) fail[t] = ne[fail[x]][i];
        q.push(t);
      } else
        ne[x][i] = ne[fail[x]][i];
    for (int i : G[fail[x]]) G[x].push_back(i);
    if (vis[x]) G[x].push_back(x);
  }
}
inline void dfs(int x, int y) {
  for (int i : v[x]) ans[i] = cnt2[id[i]];
  for (int i = fi[x]; i; i = nxt[i]) {
    int t = ne[y][sl[i] - 'a'];
    for (int j : G[t]) cnt2[j]++;
    dfs(zz[i], t);
    for (int j : G[t]) cnt2[j]--;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &opt);
    if (opt == 1) {
      scanf(" %c", &c);
      jb(0, i, c);
    } else {
      scanf("%d %c", &x, &c);
      jb(x, i, c);
    }
  }
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    scanf("%d%s", &x, s + 1);
    id[i] = insert(s);
    v[x].push_back(i);
  }
  build_fail();
  dfs(0, 0);
  for (int i = 1; i <= m; i++) printf("%d\n", ans[i]);
  return 0;
}