#include <stdio.h>
#include <stdlib.h>
 
#define CH (*s - 'a')



struct TrieNode {
	struct TrieNode *child[26];
	char childrenCount; // how many children it has - presumably useful for deletion
	short int freq; // nr of appearances of the word formed by the characters belonging to the path starting at root and ending here
};

typedef struct TrieNode TrieNode;

TrieNode mem[120000]; // chunk of 120000 nodes
int alloc_cnt = 1;
TrieNode *T = mem;

/* 0 w - adauga o aparitie a cuvantului w in lista
1 w - sterge o aparitie a cuvantului w din lista
2 w - tipareste numarul de aparitii ale cuvantului w in lista
3 w - tipareste lungimea celui mai lung prefix comun al lui w cu oricare cuvant din lista

Pentru toate operatiile, cuvantul w este format din maxim 20 de caractere din intervalul 'a'..'z'
Numarul total de operatii nu va depasi 100 000
Operatiile de tip 1 w vor aparea numai daca w apare cel putin o data in lista de cuvinte */

void add(TrieNode *node, char *s) {  // assume word '\0' terminated
	if (s[0] < 'a') { // have hit either '\0' or '\n'
		node->freq++;
		return;
	}
	if (node->child[CH] == NULL) {
		//node->child[CH] = calloc(1, sizeof(struct TrieNode));
		node->child[CH] = &mem[alloc_cnt];
		alloc_cnt++;
		node->childrenCount++;
	}
	add(node->child[CH], s+1);
}

int rm(TrieNode *node, char *s) {
	if  (s[0] < 'a') {
        node->freq--;
	}
	else if (rm(node->child[CH], s+1)) {
		node->child[CH] = 0;
		node->childrenCount--;
	}
	if (node->freq == 0 && node->childrenCount == 0 && node != T) {
		//free(node);
		return 1;
	}
	return 0;
	/*if  (s[0] < 'a') {
        node->freq--;
        return;
	}
	rm(node->child[CH], s+1);*/
}

int query(TrieNode *node, char *s) {
	while (1) {
		if (*s < 'a')
		    return node->freq;
		if (node->child[CH]) {
			node = node->child[CH];
			s++;
		}
		else
		    return 0;
	}
	/*if (*s < 'a')
		return node->freq;

	if (node->child[CH])
		return query(node->child[CH], s+1);*/
	return 0;
}

int prefix(TrieNode *node, char *s) {
	/*if (*s < 'a' || node->child[CH] == 0)
		return k;
	return prefix(node->child[CH], s+1, k+1);*/
	
	short int t = 0;
	while (1) {
		if (*s < 'a' || node->child[CH] == 0)
		    return t;
		if (node->child[CH]) {
			node = node->child[CH];
			s++;
			t++;
		}
	}
}

int main() {
	char line[ 32 ];
	char *s;
 
    freopen( "trie.in", "r", stdin );
	freopen( "trie.out", "w", stdout );
	//freopen( "grader_test20.in", "r", stdin );
	//freopen( "grader_test20.out", "w", stdout );
 
	fgets( line, 32, stdin );
 
	while( !feof( stdin ) ) {
		s = line+2;
		switch( line[0] ) {
			case '0': add( T, s ); break;
			case '1': rm( T, s ); break;
			case '2': printf( "%d\n", query( T, s) ); break;
			case '3': printf( "%d\n", prefix( T, s) ); break;
		}
		fgets( line, 32, stdin );
	}
	//printf("alloc_cnt = %d\n", alloc_cnt);
	return 0;
}