#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
using namespace std;

const string file = "trie";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f;

struct Nod
{
	int fii;
	int nr;
	Nod* t;
	Nod* n[26];

	Nod()
	{
		t = NULL;
		fii = 0;
		nr = 0;
		for(int i = 0; i < 26; i++)
		{
			n[i] = NULL;
		}
	}

};

Nod* root = new Nod();


void insert(Nod* r, string& s)
{
	Nod* c = r;
	for(unsigned i = 0; i < s.size(); i++)
	{
		if(c->n[s[i] - 'a'] == NULL)
		{
			c->n[s[i] - 'a'] = new Nod();
			c->n[s[i] - 'a']->t = c;
			c->fii ++;
		}
		c = c->n[s[i] - 'a'];
	}
	c->nr ++;

}


void erase(Nod* r, string& s)
{
	Nod* c = r;
	for(unsigned i = 0; i < s.size(); i++)
	{
		if(c->n[s[i] - 'a'] == NULL)
			return;
		c = c->n[s[i] - 'a'];
	}

	c->nr --;
	if(c -> nr == 0 && c->fii == 0)
	{
		for(int i = (int) s.size() - 1; i >= 0; i--)
		{
			c = c->t;
			if(c->n[s[i]-'a']->nr == 0 && c->n[s[i]-'a']->fii == 0)
			{
				delete c->n[s[i] - 'a'];
				c->n[s[i] - 'a'] = NULL;
				c->fii --;
			}
			else break;
		}
	}
}


int wordCount(Nod* r, string& s)
{
	Nod* c = r;
	for(unsigned i = 0; i < s.size(); i++)
	{
		if(c->n[s[i] - 'a'] == NULL)
		{
			return 0;
		}
		c = c->n[s[i] - 'a'];
	}
	return c->nr;
}

int wordPrefix(Nod* r, string& s)
{
	Nod* c = r;
	for(unsigned i = 0; i < s.size(); i++)
	{
		if(c->n[s[i] - 'a'] == NULL)
		{
			return i;
		}
		c = c->n[s[i] - 'a'];
	}
	return s.size();
}

int main()
{
	fstream fout(outfile.c_str(), ios::out);
	fstream fin(infile.c_str(), ios::in);
	int op;
	string s;

	while(fin >> op && fin >> s)
	{
		//cout << op << " " << s << "\n";

		switch(op)
		{
		case 0:
			insert(root, s);
			break;
		case 1:
			erase(root, s);
			break;
		case 2:
			fout << wordCount(root, s) << "\n";
			break;
		case 3:
			fout << wordPrefix(root, s) << "\n";
			break;
		}

	}


	fin.close();
	fout.close();
}