import java.io.*;
import java.util.HashMap;

class TrieNode {
    private HashMap<Character, TrieNode> next = new HashMap<>();
    private int count = 0;

    void insert(String word, int charIndex) {
        Character key = word.charAt(charIndex);

        if(!next.containsKey(key))
            next.put(key, new TrieNode());

        if(charIndex < word.length() - 1)
            next.get(key).insert(word, charIndex + 1);
        else
            ++next.get(key).count;
    }

    void delete(String word, int charIndex) {
        Character key = word.charAt(charIndex);

        if(!next.containsKey(key)) return;

        if(charIndex == word.length() - 1)
            --next.get(key).count;
        else
            next.get(key).delete(word, charIndex + 1);

        if(next.get(key).isRedundant())
            next.remove(key);
    }

    int count(String word, int charIndex) {
        Character key = word.charAt(charIndex);

        if(!next.containsKey(key))
            return 0;

        if(charIndex == word.length() - 1)
            return next.get(key).count;
        else
            return next.get(key).count(word, charIndex + 1);
    }

    int prefix(String word, int charIndex) {
        Character key = word.charAt(charIndex);

        if(!next.containsKey(key))
            return !isRedundant() ? charIndex : 0;

        if(charIndex == word.length() - 1)
            if(next.get(key).hasNext())
                return charIndex + 1;
            else if(next.size() > 1)
                return charIndex;
            else
                return 0;
        else
            return Math.max(next.get(key).prefix(word, charIndex + 1), next.size() > 1 ? charIndex : 0);
    }

    private boolean isRedundant() {
        return count <= 0 && !hasNext();
    }

    private boolean hasNext() {
        return !next.isEmpty();
    }

//    void print(int level) {
//        next.forEach((key, value) -> {
//                System.out.printf("Level %d edge %s count %d\n", level, key, next.get(key).count);
//                next.get(key).print(level + 1);
//            });
//    }
}

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new FileReader("trie.in"));
        BufferedWriter bw = new BufferedWriter(new FileWriter("trie.out"));

        TrieNode trieRoot = new TrieNode();

        String line;
        while((line = br.readLine()) != null) {
            String word = line.substring(2);
            switch (line.charAt(0)) {
                case '0':
                    trieRoot.insert(word, 0);
                    break;
                case '1':
                    trieRoot.delete(word, 0);
                    break;
                case '2':
                    bw.write(trieRoot.count(word, 0) + "\n");
                    break;
                case '3':
                    bw.write(trieRoot.prefix(word, 0) + "\n");
                    break;
            }
        }

//        trieRoot.print(0);

        br.close();
        bw.close();
    }
}