#include<bits/stdc++.h>

 using namespace std;

 #define Fopen freopen("_in.txt","r",stdin); freopen("_out.txt","w",stdout);

 #define LL long long

 #define ULL unsigned LL

 #define fi first

 #define se second

 #define pb push_back

 #define lson l,m,rt<<1

 #define rson m+1,r,rt<<1|1

 #define max3(a,b,c) max(a,max(b,c))

 #define min3(a,b,c) min(a,min(b,c))

 typedef pair<int,int> pll;

 const int INF = 0x3f3f3f3f;

 const LL mod =  (int)1e9+;

 const int N = 3e5 + ;

 struct Node{

     static const int m = ;static const int KN = N;

     int next[KN][m], fair[KN], tot = , mark[KN], mark1[KN], root[], cnt = , si[];

     void Build(int x){

         queue<int> q;

         q.push(x);

         int pos, p, v;

         while(!q.empty()){

             pos = q.front(), q.pop();

             for(int i = ; i < m; i++){

                 if(!next[pos][i]) continue;

                 p = fair[pos]; v = next[pos][i];

                 while(p && !next[p][i]) p = fair[p];

                 if(p) fair[v] = next[p][i];

                 else fair[v] = x;

                 q.push(v);

                 mark1[v] = mark1[fair[v]] + mark[v];

             }

         }

     }

     void Add(char s[], char ch){

         root[++cnt] = ++tot; si[cnt] = ;

         int pos = root[cnt];

         for(int i = ; s[i]; i++){

             if(!next[pos][s[i]-ch]) next[pos][s[i]-ch] = ++tot;

             pos = next[pos][s[i]-ch];

         }

         mark[pos]++;

         while(si[cnt] == si[cnt-]){

             Unit(root[cnt-], root[cnt]);

             si[--cnt] *= ;

         }

         Build(root[cnt]);

     }

     int Query(char s[], char ch){

         int pos, ret = ;

         for(int id = ; id <= cnt; id++){

             pos = root[id];

             for(int i = ; s[i]; i++){

                 while(pos && !next[pos][s[i]-ch]) pos = fair[pos];

                 if(pos) pos = next[pos][s[i]-ch];

                 else pos = root[id];

                 ret += mark1[pos];

             }

         }

         return ret;

     }

     void Unit(int u, int v){

         mark[u] += mark[v];

         for(int i = ; i < m; i++){

             if(!next[u][i] || !next[v][i]) next[u][i] += next[v][i];

             else Unit(next[u][i], next[v][i]);

         }

     }

 }ac[];

 char str[N];

 int main(){

     int n, k;

     scanf("%d", &n);

     while(n--){

         scanf("%d%s", &k, str);

         if(k <= ) ac[k-].Add(str, 'a');

         else {

             printf("%d\n", ac[].Query(str, 'a')-ac[].Query(str, 'a'));

             fflush(stdout);

         }

     }

     return ;

 }