#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<string> s(n);
  VI len(n);
  rep(i, n) cin >> s[i], len[i] = s[i].size();
  int q;
  cin >> q;
  vector<P> qs(q);
  rep(i, q) {
    int t;
    cin >> t;
    if (t == 1) {
      int x;
      char c;
      cin >> x >> c;
      x--;
      s[x] += c;
      qs[i] = {t, x};
    } else {
      int x;
      cin >> x;
      x--;
      qs[i] = {t, x};
    }
  }
  vector<int> s_tot;
  int sep = 26;
  VI spos(n);
  rep(i, n) {
    spos[i] = s_tot.size();
    for(char c: s[i]) s_tot.emplace_back(c - 'a');
    s_tot.emplace_back(sep++);
  }
  VI sa = suffix_array(s_tot);
  auto lcp = lcp_array(s_tot, sa);
  lcp.insert(lcp.begin(), 1, -1);
  lcp.emplace_back(-1);

  int sz = sa.size();
  VI sa_inv(sz);
  rep(i, sz) sa_inv[sa[i]] = i;
  vector<char> is_front(sz);
  for(int i: spos) is_front[sa_inv[i]] = true;
  VI occ_acc(sz + 1);
  rep(i, sz) occ_acc[i + 1] = occ_acc[i] + is_front[i];
  vector<pair<int, int>> to1(sz + 1), to2(sz + 1);
  {
    vector<P> st;
    st.emplace_back(0, 0);
    rep(i, sz) {
      int cnt = is_front[i];
      while (lcp[st.back().first] > lcp[i + 1]) {
        cnt += st.back().second;
        st.pop_back();
      }
      to1[i + 1] = {st.back().first, cnt};
      st.emplace_back(i + 1, cnt);
    }
  }
  {
    vector<P> st;
    st.emplace_back(sz, 0);
    to2[0] = {sz, 0};
    rrep(i, sz) {
      int cnt = is_front[i];
      while (lcp[st.back().first] > lcp[i]) {
        cnt += st.back().second;
        st.pop_back();
      }
      to2[i] = {st.back().first, cnt};
      st.emplace_back(i, cnt);
    }
  }
  VL acc_f(sz + 1), acc_b(sz + 1);
  for (int i = 1; i <= sz; i++) {
    auto [j, c] = to1[i];
    acc_f[i] = acc_f[j] + (ll)c * lcp[i];
  }
  for (int i = sz - 1; i >= 0; i--) {
    auto [j, c] = to2[i];
    acc_b[i] = acc_b[j] + (ll)c * lcp[i];
  }
  vector<vector<int>> to1k(19, vector<int>(sz + 1)), to2k = to1k;
  rep(i, sz + 1) to1k[0][i] = to1[i].first;
  rep(i, sz + 1) to2k[0][i] = to2[i].first;
  rep(k, 18) rep(i, sz + 1) {
    to1k[k+1][i] = to1k[k][to1k[k][i]];
    to2k[k+1][i] = to2k[k][to2k[k][i]];
  }
  for(auto [t, x]: qs) {
    if (t == 1) {
      len[x]++;
    } else {
      int l = len[x];
      ll ans = l;
      int i = sa_inv[spos[x]];
      int j = i;
      rrep(k, 19) {
        int nj = to1k[k][j];
        if (lcp[nj] >= l) j = nj;
      }
      j = to1k[0][j];
      ans += (ll)l * (occ_acc[i] - occ_acc[j]);
      ans += acc_f[j];
      i++;
      j = i;
      rrep(k, 19) {
        int nj = to2k[k][j];
        if (lcp[nj] >= l) j = nj;
      }
      j = to2k[0][j];
      ans += (ll)l * (occ_acc[j] - occ_acc[i]);
      ans += acc_b[j];
      cout << ans-1 << '\n';
    }
  }
}