/* -*- coding: utf-8 -*-
 *
 * 2020.cc:  No.2020 Sum of Common Prefix Length - yukicoder
 */

#include<cstdio>
#include<string>
#include<vector>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_QN = 200000;
const int MAX_L = 200000;
const int MAX_M = MAX_L + MAX_QN;

/* typedef */

struct Query {
  int t, x, c;
  Query() {}

  void read() {
    scanf("%d%d", &t, &x), x--;
    if (t == 1) {
      char w[4];
      scanf("%s", w);
      c = w[0];
    }
    else
      c = -1;
  }
};

template <typename T>
struct SegTreeSum {
  int e2;
  vector<T> nodes;
  T defv;
  SegTreeSum() {}

  void init(int n, T _defv) {
    defv = _defv;
    for (e2 = 1; e2 < n; e2 <<= 1);
    nodes.assign(e2 * 2, defv);
  }

  T &geti(int i) { return nodes[e2 - 1 + i]; }
  void seti(int i, T v) { geti(i) = v; }

  void setall() {
    for (int j = e2 - 2; j >= 0; j--)
      nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];
  }

  void set(int i, T v) {
    int j = e2 - 1 + i;
    nodes[j] = v;
    while (j > 0) {
      j = (j - 1) / 2;
      nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];
    }
  }

  T sum_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return defv;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    int im = (i0 + i1) / 2;
    T v0 = sum_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = sum_range(r0, r1, k * 2 + 2, im, i1);
    return v0 + v1;
  }
  T sum_range(int r0, int r1) { return sum_range(r0, r1, 0, 0, e2); }
};


/* global variables */

char s[MAX_L + 4];
string ss[MAX_N];
int sps[MAX_N], ses[MAX_N];
int cs[MAX_M][26], ps[MAX_M], vcs[MAX_M];
int cis[MAX_M], ls[MAX_M], rs[MAX_M];
Query qs[MAX_QN];
SegTreeSum<int> st;

/* subroutines */

void trie_init(int i, int pi = -1) {
  fill(cs[i], cs[i] + 26, -1);
  ps[i] = pi, vcs[i] = 0;
}

int trie_append(int u, int c, int &m) {
  int id = c - 'a';
  if (cs[u][id] < 0) {
    trie_init(m, u);
    cs[u][id] = m++;
  }
  return cs[u][id];
}

int trie_add(string &si, int &m) {
  int u = 0;
  for (auto ci: si) {
    int v = trie_append(u, ci, m);
    vcs[v]++;
    u = v;
  }
  return u;
}

/* main */

int main() {
  int n;
  scanf("%d", &n);

  trie_init(0);
  int m = 1;

  for (int i = 0; i < n; i++) {
    scanf("%s", s);
    ss[i] = string(s);
    sps[i] = ses[i] = trie_add(ss[i], m);
  }
  //printf("m=%d\n", m);

  int qn;
  scanf("%d", &qn);

  for (int i = 0; i < qn; i++) {
    qs[i].read();
    if (qs[i].t == 1) {
      int xi = qs[i].x;
      ses[xi] = trie_append(ses[xi], qs[i].c, m);
    }
  }
  //printf("m=%d\n", m);

  for (int u = 0, k = 0; u >= 0;) {
    int *cu = cs[u], up = ps[u];

    if (cis[u] == 0) ls[u] = k++;
    while (cis[u] < 26 && cu[cis[u]] < 0) cis[u]++;
    if (cis[u] < 26) {
      int v = cu[cis[u]++];
      u = v;
    }
    else {
      rs[u] = k++;
      u = up;
    }
  }

  st.init(m * 2, 0);
  for (int u = 0; u < m; u++) {
    st.seti(ls[u], vcs[u]);
    st.seti(rs[u], -vcs[u]);
  }
  st.setall();

  for (int i = 0; i < qn; i++) {
    Query &qi = qs[i];

    if (qi.t == 1) {
      int u = sps[qi.x] = cs[sps[qi.x]][qi.c - 'a'];
      vcs[u]++;
      st.set(ls[u], st.geti(ls[u]) + 1);
      st.set(rs[u], st.geti(rs[u]) - 1);
    }
    else {
      int e = st.sum_range(0, ls[sps[qi.x]] + 1);
      printf("%d\n", e);
    }
  }
  return 0;
}