#include <bits/stdc++.h>

using namespace std;

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

struct node{
	int nr_cuv;
	int nr_son;
	node *son[27];
	node(){
		nr_cuv = 0;
		nr_son = 0;
		memset(son, 0, sizeof son);
	}
};

node *root;
string s;	
int sz, cod;

void baga(node *nod, int p){
	if(p == sz){
		nod -> nr_cuv++;
		return;
	}
	if(nod -> son[s[p] - 'a'] == NULL){
		nod -> nr_son++;
		nod -> son[s[p] - 'a'] = new node();
	}
	baga(nod -> son[s[p] - 'a'], p + 1);
}

bool scoate(node *nod, int p){
	if(p == sz){
		nod -> nr_cuv--;
		if(nod -> nr_cuv == 0 && nod -> nr_son == 0 && nod != root){
			delete nod;
			return 1;
		}
		return 0;
	}
	if(scoate(nod -> son[s[p] - 'a'], p + 1)){
		nod -> nr_son--;
		nod -> son[s[p] - 'a'] = 0;
		if(nod -> nr_cuv == 0 && nod -> nr_son == 0 && nod != root){
			delete nod;
			return 1;
		}
	}
	return 0;
}

int aparitii(node *nod, int p){
	if(p == sz)
		return nod -> nr_cuv;
	if(nod -> son[s[p] - 'a'] == NULL)
		return 0;
	return aparitii(nod -> son[s[p] - 'a'], p + 1);
}

int prefix(node *nod, int p){
	if(p == sz || nod -> son[s[p] - 'a'] == NULL)
		return 0;
	return 1 + prefix(nod -> son[s[p] - 'a'], p + 1);
}

int main(){
	root = new node();
	while(in >> cod){
		in >> s;
		sz = s.size();
		if(cod == 0){
			baga(root, 0);
			continue;
		}
		if(cod == 1){
			scoate(root, 0);
			continue;
		}
		if(cod == 2){
			out << aparitii(root, 0) << '\n';
			continue;
		}
		if(cod == 3){
			out << prefix(root, 0) << '\n';
			continue;
		}
	}
	return 0;
}