#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ar array
#define vt vector
#define pq priority_queue
#define pu push
#define pub push_back
#define em emplace
#define emb emplace_back

#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define allp(x, l, r) x.begin() + l, x.begin() + r
#define len(x) (int)x.size()

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <class T, size_t N>
void re(array <T, N>& x);
template <class T> 
void re(vt <T>& x);

template <class T> 
void re(T& x) {
    cin >> x;
}

template <class T, class... M> 
void re(T& x, M&... args) {
    re(x); re(args...);
}

template <class T> 
void re(vt <T>& x) {
    for(auto& it : x)
        re(it);
}

template <class T, size_t N>
void re(array <T, N>& x) {
    for(auto& it : x)
        re(it);
}

template <class T, size_t N>
void wr(array <T, N> x);
template <class T> 
void wr(vt <T> x);

template <class T> 
void wr(T x) {
    cout << x;
}

template <class T, class ...M>  void wr(T x, M... args) {
    wr(x), wr(args...);
}

template <class T> 
void wr(vt <T> x) {
    for(auto it : x)
        wr(it, ' ');
}

template <class T, size_t N>
void wr(array <T, N> x) {
    for(auto it : x)
        wr(it, ' ');
}


inline void Open(const string Name) {
    #ifndef ONLINE_JUDGE
        (void)!freopen((Name + ".in").c_str(), "r", stdin);
        (void)!freopen((Name + ".out").c_str(), "w", stdout);
    #endif
}

struct Trie {
    struct node {
        node* nxt[26];
        int sz;

        node() {
            sz = 0;
            for (int i = 0; i < 26; ++i)
                nxt[i] = nullptr;
        }
    } *root;

    Trie() {
        root = new node();
    }
    ~Trie() {

    }

    void insert(const string& s) {
        node* cur = root;
        for (int i = 0;i < len(s); ++i) {
            if (cur -> nxt[s[i] - 'a'] == nullptr) {
                cur -> nxt[s[i] - 'a'] = new node();
            }
            cur = cur -> nxt[s[i] - 'a'];
        }
        cur -> sz++;
    }

    bool del(const string& s, int p, node* cur) {
        if (p == len(s)) {
            cur -> sz--;
            if (cur -> sz == 0) {
                delete(cur);
                return 1;
            }
            return 0;
        }

        if (del(s, p + 1, cur -> nxt[s[p] - 'a'])) {
            cur -> nxt[s[p] - 'a'] = nullptr;
        }

        for (int i = 0; i < 26; ++i)
            if (cur -> nxt[i] != nullptr) {
                return 0;
            }

        if (cur != root) {
            delete cur;
            return 1;
        }
        return 0;
    }

    int query(const string& s) {
        node* cur = root;
        for (int i = 0;i < len(s); ++i) {
            if (cur -> nxt[s[i] - 'a'] == nullptr) {
                cur -> nxt[s[i] - 'a'] = new node();
            }
            cur = cur -> nxt[s[i] - 'a'];
        }
        return cur -> sz;
    }

    int lcm(const string& s) {
        node *cur = root;
        for (int i = 0; i < len(s); ++i) {
            if (cur -> nxt[s[i] - 'a'] == nullptr) {
                return i;
            }
            cur = cur -> nxt[s[i] - 'a'];
        }
        return len(s);
    }
};

void solve() {
    /* standard algorithm */
    int task; string s;
    Trie T;
    while (cin >> task >> s) {
        switch (task) {
            case 0: T.insert(s); break;
            case 1: T.del(s, 0, T.root); break;
            case 2: wr(T.query(s), '\n'); break;
            case 3: wr(T.lcm(s), '\n'); break;
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    Open("trie");

    int t = 1;
    for(;t;t--) {
        solve();
    }
    
    return 0;
}