#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
string __fname = "trie"; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
#define cin in 
#define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const int64 hash_inv = 940594066;
const double pi = 3.14159265359;
const int64 hash_p = 101;
const int64 mod = 1000000007;
const int maxn = 200200;

void solve(int id){
    
    return;
}

struct trie {
    int count;
    int children;
    trie *son [26];

    trie () {
        count = 0;
        children = 0;
        for (int i = 0; i < 26; i++){
            son[i] = NULL;
        }
    }
};
trie *head = new trie;

void insert (trie *now, string &s, int idx) {
    if (idx == s.size()) {
        now->count++;
        return;
    }
    if (now->son[s[idx] - 'a'] == NULL) {
        now->son[s[idx] - 'a'] = new trie;
        now->children++;
    }
    insert(now->son[s[idx] - 'a'], s, idx + 1);
}

bool remove (trie *now, string &s, int idx) {
    if (idx == s.size()) {
        now->count--;
    }
    else if (remove(now->son[s[idx] - 'a'], s, idx + 1)) {
        now->children--;
        now->son[s[idx] - 'a'] = NULL;
    }
    if (now->count == 0 && now->children == 0 && now != head) {
        delete now;
        return 1;
    }
    return 0;
}

int count (trie *now, string &s, int idx) {
    if (now == NULL) return 0;
    if (idx == s.size()) return now->count;
    return count(now->son[s[idx] - 'a'], s, idx + 1);
}

int pref (trie *now, string &s, int idx, int depth) {
    if (idx == s.size() || now->son[s[idx] - 'a'] == NULL) return depth;
    return pref(now->son[s[idx] - 'a'], s, idx + 1, depth + 1);
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10); 
    int t;
    string s;
    while (cin >> t && cin >> s) {
        if (t == 0) insert(head, s, 0);
        else if (t == 1) remove(head, s, 0);
        else if (t == 2) cout << count(head, s, 0) << "\n";
        else if (t == 3) cout << pref(head, s, 0, 0) << "\n";
    }
    return 0;
}