#include <fstream>
#include <vector>
#include <cstring>
using namespace std;

ifstream is("trie.in");
ofstream os("trie.out");

struct Trie{
    Trie() : nrcuv(0), nrfii(0)
    {
        memset(fii, 0, sizeof(fii));
    }
public:
    int nrcuv, nrfii;
    Trie* fii[26];
} *t;

void Insert(Trie *nod, char *cuv);
bool Delete(Trie *nod, char *cuv);
void Count(Trie *nod, char *cuv);
void Prefix(Trie *nod, char *cuv, int k);

int main()
{
    t = new Trie;
    char cuv[25];
    is.getline(cuv, 25, '\n');
    do {
        switch(cuv[0])
        {
            case '0': Insert(t, cuv + 2); break;
            case '1': Delete(t, cuv + 2); break;
            case '2': Count(t, cuv + 2); break;
            case '3': Prefix(t, cuv + 2, 0); break;
        }
        is.getline(cuv, 25, '\n');
    } while ( cuv[0] );
    is.close();
    os.close();
    return 0;
}

void Insert(Trie *nod, char *cuv)
{
    if ( *cuv == '\0' )
    {
        ++nod->nrcuv;
        return;
    }
    if ( !nod->fii[*cuv - 'a'] )
    {
        nod->fii[*cuv - 'a'] = new Trie;
        ++nod->nrfii;
    }
    Insert(nod->fii[*cuv - 'a'], cuv + 1);
}

bool Delete(Trie *nod, char *cuv)
{
    if ( *cuv == '\0' )
    {
        --nod->nrcuv;
        if ( !nod->nrcuv && !nod->nrfii )
        {
            delete nod;
            return true;
        }
        return false;
    }
    if ( Delete(nod->fii[*cuv - 'a'], cuv + 1) )
    {
        nod->fii[*cuv - 'a'] = 0;
        --nod->nrfii;
        if ( !nod->nrcuv && !nod->nrfii && nod != t )
        {
            delete nod;
            return true;
        }
        return false;
    }
        return false;
}

void Count(Trie *nod, char *cuv)
{
    if ( *cuv == '\0' )
    {
        os << nod->nrcuv << "\n";
        return;
    }
    if ( nod->fii[*cuv - 'a'] )
        Count(nod->fii[*cuv - 'a'], cuv + 1);
    else
        os << "0\n";
}

void Prefix(Trie *nod, char *cuv, int k)
{
    if ( *cuv == '\0' || !nod->fii[*cuv - 'a'] )
        os << k << "\n";
    else
        Prefix(nod->fii[*cuv - 'a'], cuv + 1, k + 1);
}