#include<bits/stdc++.h>
using namespace std;
int main(){
  int N;cin >> N;
  vector<string> S(N);
  for(string &s:S) cin >> s;
  vector<char> node({0});
  vector<vector<int>> nex(1,vector<int>(26,-1)),cnt(1);
  for(int i=0;i<N;i++){
    int now = 0;cnt[0].emplace_back(i);
    for(char c:S[i]){
      int z = c-'a';
      if(nex[now][z] == -1){
        nex[now][z] = node.size();
        node.emplace_back(c);
        nex.emplace_back(vector<int>(26,-1));
        cnt.emplace_back(vector<int>());
      }
      now = nex[now][z];cnt[now].emplace_back(i);
    }
  }
  vector<int> ans(N),pos(N);
  for(int i=0;i<N;i++){
    int now = 0;
    for(char c:S[i]){
      int z = c-'a';
      now = nex[now][z];
      ans[i] += cnt[now].size();
    }
    pos[i] = now;
  }
  int Q;cin >> Q;
  for(int i=0;i<Q;i++){
    int t,x;cin >> t >> x;x--;
    if(t == 1){
      char c;cin >> c;
      int z = c-'a';
      if(nex[pos[x]][z] == -1){
        nex[pos[x]][z] = node.size();
        node.emplace_back(c);
        nex.emplace_back(vector<int>(26,-1));
        cnt.emplace_back(vector<int>());
      }
      pos[x] = nex[pos[x]][z];
      ans[x] += cnt[pos[x]].size();
      cnt[pos[x]].emplace_back(x);
      for(int itr:cnt[pos[x]]) ans[itr]++;
    }
    else{
      cout << ans[x] << "\n";
    }
  }

}