#include<fstream>
#include<string.h>
using namespace std;
ifstream f("trie.in");
ofstream g("trie.out");
int x;
char cuv[20];
class nod
{   public:
	int nr_cuvinte,ex_cuv;
	nod *fii[26];
}*rad=new nod;
void ad_cuv(char *w)
{   
	nod *aux=rad;
	for(int i=0;i<strlen(w);i++)
		if(aux->fii[w[i]-'a']==NULL)
		{  
			aux->fii[w[i]-'a']=new nod;
			aux=aux->fii[w[i]-'a'];
			++aux->ex_cuv;
		}
        else
         {  
         	aux=aux->fii[w[i]-'a'];
         	++aux->ex_cuv;
         }
   	++aux->nr_cuvinte;
}
bool del_cuv(char *w,nod *q,int poz)
{
	if(poz==strlen(w))//suntem la sfarsit
	{
		--q->nr_cuvinte;
		--q->ex_cuv;
	}
    else if(del_cuv(w,q->fii[w[poz]-'a'],poz+1)) //nu mai are fiul resp
    	  {
    	  	q->fii[w[poz]-'a']=NULL;
    	  }
    if(q->ex_cuv==0&&q!=rad)
    {
     delete q;
     return 1;
    }
    --q->ex_cuv;
    return 0;
}
void print_nrcuv (char *w)
{
	nod *aux=rad; int i;
	for(i=0;i<strlen(w)&&aux->fii[w[i]-'a']!=NULL;aux=aux->fii[w[i]-'a'],i++);
	g<<(aux->nr_cuvinte)*(i==strlen(w))<<'\n';
}
void prefix_maxim(char *w)
{
	int i=0;
	nod *aux=rad;
	for(i=0;i<strlen(w)&&aux->fii[w[i]-'a']!=NULL;aux=aux->fii[w[i]-'a'],i++);
    g<<i<<'\n';
  
}
int main()
{
	while(f>>x>>cuv)
	{   
		switch(x)
		{
			case 0:
			ad_cuv(cuv);
			break;
			case 1:
			del_cuv(cuv,rad,0);
			break;
			case 2:
			print_nrcuv(cuv);
			break;
			case 3:
			prefix_maxim(cuv);
			break;
		}
	}
	f.close();
	g.close();
  return 0;
}