import java.io.*;
import java.util.Arrays;

public class Main {

    public static void main(String[] args) throws IOException {
        try (BufferedReader bufferedReader = new BufferedReader(new FileReader("trie.in"));
            BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter("trie.out"))) {
            TrieGraph graph = new TrieGraph();

            String line = bufferedReader.readLine();
            while (line != null) {
                int opType = line.charAt(0) - '0';
                String word = line.substring(2);

                switch (opType) {
                    case 0:
                        graph.addWord(word);
                        break;
                    case 1:
                        graph.removeWord(word);
                        break;
                    case 2:
                        bufferedWriter.write(graph.getWordCount(word) + "\n");
                        break;
                    case 3:
                        bufferedWriter.write(graph.getLongestCommonPrefix(word) + "\n");
                        break;
                    default:
                        throw new RuntimeException("Encountered unexpected opType");
                }

                line = bufferedReader.readLine();
            }
        }
    }

    static class TrieGraph {

        public static final int SIGMA = 26;

        private TrieNode root;

        public TrieGraph() {
            root = new TrieNode();
        }

        public void addWord(String word) {
            TrieNode currNode = root;
            currNode.updatePassingNodesCount(1);
            for (char entry : word.toCharArray()) {
                currNode = currNode.getOrCreateChild(entry - 'a');
                currNode.updatePassingNodesCount(1);
            }

            currNode.updateWordsEndingHere(1);
        }

        public void removeWord(String word) {
            removeWord(word.toCharArray(), 0, root);
        }

        public int getWordCount(String word) {
            TrieNode currNode = root;
            for (char entry : word.toCharArray()) {
                currNode = currNode.getChild(entry - 'a');
                if (currNode == null) {
                    return 0;
                }
            }

            return currNode.getWordsEndingHere();
        }

        public int getLongestCommonPrefix(String word) {
            TrieNode currNode = root;
            int commonPrefix = 0;
            for (char entry : word.toCharArray()) {
                currNode = currNode.getChild(entry - 'a');
                if (currNode == null) {
                    break;
                }
                commonPrefix++;
            }

            return commonPrefix;
        }

        public void removeWord(char[] word, int currPos, TrieNode currNode) {
            currNode.updatePassingNodesCount(-1);
            if (currPos == word.length) {
                currNode.updateWordsEndingHere(-1);
                return;
            }
            int childIdx = word[currPos] - 'a';
            TrieNode child = currNode.getChild(childIdx);

            removeWord(word, currPos + 1, child);
            if (child.getWordsPassingThroughThisNode() == 0) {
                currNode.removeChild(childIdx);
            }
        }
    }

    static class TrieNode {

        private TrieNode[] children;

        private int wordsEndingHere;

        private int wordsPassingThroughThisNode;

        public TrieNode() {
            wordsEndingHere = wordsPassingThroughThisNode = 0;
            children = new TrieNode[TrieGraph.SIGMA];
            Arrays.fill(children, null);
        }

        public void updatePassingNodesCount(int count) {
            wordsPassingThroughThisNode += count;
        }

        public void updateWordsEndingHere(int count) {
            wordsEndingHere += count;
        }

        public TrieNode getOrCreateChild(int childIdx) {
            TrieNode child = children[childIdx];
            if (child == null) {
                child = new TrieNode();
                children[childIdx] = child;
            }

            return child;
        }

        public int getWordsPassingThroughThisNode() {
            return wordsPassingThroughThisNode;
        }

        public int getWordsEndingHere() {
            return wordsEndingHere;
        }

        public TrieNode getChild(int childIdx) {
            return children[childIdx];
        }

        public void removeChild(int childIdx) {
            children[childIdx] = null;
        }
    }
}