#include<fstream>
#include<cstdio>
#include<set>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll unsigned long long
#define bit 20
#define inf 500000000
#define base 256
#define ba 255
#define N 30
#define mod  1999999973
#define inu "trie.in"
#define outu "trie.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
struct Trie
{
    Trie *fiu[27];
    int nrf,nrs;
    Trie()
    {
        memset(fiu,0,sizeof(fiu));
        nrf=nrs=0;
    }
};
Trie *r=new Trie;
char s[N];
int n,tip,t;
void insert(Trie *nod,char *p)
{
    ++nod->nrf;
    if(!(*p))
    {
        nod->nrs++;
        return ;
    }
    if(nod->fiu[*p]!=NULL)
    insert(nod->fiu[*p],p+1);
    else
    {
        nod->fiu[*p]=new Trie;
        insert(nod->fiu[*p],p+1);
    }
}
int erase(Trie *nod,char *p)
{
    if(!(*p))
    {
        nod->nrs--;
        nod->nrf--;
        if(!nod->nrf)
        {
            delete(nod);
            return 1;
        }
        else
        return 0;
    }
    nod->nrf--;
    if(erase(nod->fiu[*p],p+1))
        nod->fiu[*p]=NULL;
    if(nod==r)
    return 0;
    if(!nod->nrf)
    {
        delete(nod);
        return 1;
    }
    return 0;
}
int pref(Trie *nod,char *p,int x)
{
    if(!(*p))
        return x;
    if(nod->fiu[*p])
    return pref(nod->fiu[*p],p+1,x+1);
    else
    return x;
}
int find(Trie *nod,char *p)
{
    if(!(*p))
    {
        return nod->nrs;
    }
    if(nod->fiu[*p])
    return find(nod->fiu[*p],p+1);
    else
    return 0;
}
int main ()
{
    while(f>>tip)
    {
        f>>s;
        t=strlen(s);
        FOR(j,0,t-1) s[j]-=('a'-1);
        s[t]=0;
        if(!tip)
        insert(r,s);
        if(tip==1)
        t=erase(r,s);
        if(tip==2)
        g<<find(r,s)<<"\n";
        if(tip==3)
        g<<pref(r,s,0)<<"\n";
    }
    return 0;
}