#include <fstream>
#include <queue>
using namespace std;
int main()
{
    ofstream fout("hipsters.out");
    ifstream fin("hipsters.in");
    vector<string> liked;
    int n;
    fin >> n;
    for(int i = 0; i < n; i ++)
    {
        int t;
        string p;
        fin >> t >> p;
        if(t == 2)
        {
            liked.push_back(p);
        }
        if(t == 3)
        {
            for(int j = 0; j < liked.size(); j ++)
            {
                if(liked[j] == p)
                {
                    liked.erase(liked.begin()+j);
                    j = liked.size()+2;
                }
            }
        }
        if(t == 1)
        {
            int ans = 0;
            for(int j = 0; j < liked.size(); j ++)
            {
                int common = 0;
                for(int a = 0; a<liked[j].size(); a ++)
                {
                    if(a < p.size() && liked[j][a] == p[a]) common ++;
                }
                ans += p.size()-common+liked[j].size()-common;
            }
            if(p == "0") ans--;
            fout << ans << endl;
        }
    }
}