#include<cstdio>

#include<cstring>

#include<algorithm>

#define ls c[cr][0]

#define rs c[cr][1]

using namespace std;

int rdn()

{

  int ret=;bool fx=;char ch=getchar();

  while(ch>''||ch<''){if(ch=='-')fx=;ch=getchar();}

  while(ch>=''&&ch<='')ret=ret*+ch-'',ch=getchar();

  return fx?ret:-ret;

}

const int N=1e5+,M=2e6+,K=;

int n,ps[N],tot=,c[M][K],tc[M][K],fl[M],q[M];

int tim,dfn[M],fa[M],vl[M],tg[M],sta[M];

char s[M];

bool isrt(int x){return c[fa[x]][]!=x&&c[fa[x]][]!=x;}

void cz(int cr)

{

  if(!tg[cr])return; int w=tg[cr];tg[cr]=;

  vl[ls]+=w; vl[rs]+=w;

  tg[ls]+=w; tg[rs]+=w;

  dfn[ls]=dfn[rs]=dfn[cr];///

}

void rotate(int x)

{

  int y=fa[x],z=fa[y],d=(x==c[y][]);

  if(!isrt(y))c[z][y==c[z][]]=x;

  fa[x]=z; fa[y]=x; fa[c[x][!d]]=y;

  c[y][d]=c[x][!d]; c[x][!d]=y;

}

void splay(int x)

{

  int top; sta[top=]=x;

  for(int k=x;!isrt(k);k=fa[k])sta[++top]=fa[k];

  for(int i=top;i;i--)cz(sta[i]);

  for(int y=fa[x],z=fa[y];!isrt(x);rotate(x),y=fa[x],z=fa[y])

    if(!isrt(y))

      ((y==c[z][])^(x==c[y][]))?rotate(x):rotate(y);

}

void access(int x)

{

  splay(x); if(dfn[x]==tim)return;

  int t=;

  while()

    {

      c[x][]=t;

      if(!fa[x])

    { tg[x]++;vl[x]++;dfn[x]=tim;return;}

      splay(fa[x]);//splay first

      if(dfn[fa[x]]==tim)

    { tg[x]++;vl[x]++;dfn[x]=tim;return;}

      t=x; x=fa[x];

    }

}

void link(int x,int y){ fa[y]=x;}

int Ins()

{

  int cr=,len=strlen(s+);

  for(int i=;i<=len;i++)

    {

      int w=s[i]-'a';

      if(!tc[cr][w])tc[cr][w]=++tot;

      cr=tc[cr][w];

    }

  return cr;

}

void get_fl()

{

  int he=,tl=;

  for(int i=,v;i<K;i++)

    if((v=tc[][i]))

      {q[++tl]=v;fl[v]=;link(,v);}

    else tc[][i]=;

  while(he<tl)

    {

      int k=q[++he],pr=fl[k];

      for(int i=,v;i<K;i++)

    if((v=tc[k][i]))

      { q[++tl]=v;fl[v]=tc[pr][i];link(tc[pr][i],v);}

    else tc[k][i]=tc[pr][i];

    }

}

void solve()

{

  tim++; int cr=,len=strlen(s+);

  for(int i=;i<=len;i++)

    {

      cr=tc[cr][s[i]-'a'];

      access(cr);

    }

}

int main()

{

  n=rdn();

  for(int i=;i<=n;i++)

    { scanf("%s",s+); ps[i]=Ins();}

  get_fl();

  int Q=rdn(),op,x;

  while(Q--)

    {

      op=rdn();

      if(op==)

    { scanf("%s",s+); solve();}

      else

    {

      x=rdn(); x=ps[x];

      splay(x); printf("%d\n",vl[x]);

    }

    }

  return ;

}