#include <iostream>
#include <string>
using namespace std;
const int N = 150001;
int tree[N][26];
int ed[N];
int path[N];
int index = 1;


//https://www.nowcoder.com/practice/7f8a8553ddbf4eaab749ec988726702b 牛客的trie树，感觉要点有两个，第一个，插入的时候也要记录前缀路径，第二个，查询前缀数量的时候，要查到尾部才能返回，中间断开要返回0
void insert(string& s) {
    int root = 0;
    path[root]++;//插入计数
    for (int i = 0; i < s.size(); i++) {
        if (tree[root][s[i] - 'a'] > 0) {
            root = tree[root][s[i] - 'a'];
        } else {
            tree[root][s[i] - 'a'] = index;
            root = index++;
        }
        path[root]++;
    }
    ed[root]++;
}

bool search(string&s){
    int root = 0;
    for(int i=0;i<s.size();i++){
        if (tree[root][s[i] - 'a'] > 0) {
            root = tree[root][s[i] - 'a'];
        } else {
            return false;
        }
    }
    return ed[root];
}

int fin(string& s) {
    int root = 0;
    for (int i = 0; i < s.size(); i++) {
        if (tree[root][s[i] - 'a'] > 0) {
            root = tree[root][s[i] - 'a'];
        } else {
            return 0;//断开要返回0
        }
    }
    return path[root];
}

void delate(string& s) {
    int root = 0;
    for (int i = 0; i < s.size(); i++) {
        if (tree[root][s[i] - 'a'] > 0) {
            root = tree[root][s[i] - 'a'];
        } else {
            return;
        }
        if (--path[root] == 0) {//要先删除路径，再看是否断开
            tree[root][s[i] - 'a'] = 0;
        }
    }
    ed[root]--;
}

int main() {
    int n, op;
    string s;
    cin >> n;
    while (n--) {
        cin >> op >> s;
        if (op == 1) {
            insert(s);
        } else if (op == 2) {
            delate(s);
        } else if (op == 3) {
            if (search(s)) {
                cout << "YES" << endl;
            } else {
                cout << "NO" << endl;
            }
        } else {
            cout << fin(s) << endl;
        }
    }
}
// 64 位输出请用 printf("%lld")