#include <iostream>
#include <deque>
#include <vector>
#include <cstring>
#include <bitset>
#include <algorithm>
#include <queue>
#define INF 1<<30
#define uint unsigned int
#define ll long long
using namespace std;

struct trie{
    int cnt;
    int ok;
    trie* fii[26];
    trie()
    {
        cnt = ok = 0;
        for(int i = 0; i < 26; i++)
            fii[i] = NULL;
    }
} *aux, *root;

int t,i,len,ok,sol;
char S[22];

int main()
{
    freopen("trie.in","r",stdin);
    freopen("trie.out","w",stdout);
    root = new trie();
    while(scanf("%d", &t) > 0)
    {
        scanf(" %s", S);
        if(t == 0)
        {
            aux = root;
            len = strlen(S);
            for(i=0;i<len;i++)
            {
                if(aux->fii[S[i]-'a'] == NULL)
                    aux->fii[S[i]-'a'] = new trie();
                aux = aux->fii[S[i]-'a'];
                aux->cnt = aux->cnt + 1;
            }
            aux->ok = aux->ok + 1;
        }
        if(t == 1)
        {
            aux = root;
            len = strlen(S);
            for(i=0;i<len;i++)
            {
                aux = aux->fii[S[i]-'a'];
                aux->cnt = aux->cnt - 1;
            }
            aux->ok = aux->ok - 1;
        }
        if(t == 2)
        {
            aux = root;
            len = strlen(S);
            ok = 1;
            for(i=0;i<len;i++)
            {
                if(aux->fii[S[i]-'a'] == NULL)
                {
                    ok = 0;
                    break;
                }
                aux = aux->fii[S[i]-'a'];
            }
            if(ok)ok = aux->ok;
            printf("%d\n",ok);
        }
        if(t == 3)
        {
            aux = root;
            len = strlen(S);
            sol = 0;
            for(i=0;i<len;i++)
            {
                if(aux->fii[S[i]-'a'] == NULL)
                    break;
                aux = aux->fii[S[i]-'a'];
                if(aux->cnt == 0)
                    break;
                sol = sol + 1;
            }
            printf("%d\n",sol);
        }
    }
    return 0;
}