#include <cstdio>
#include <unordered_map>

using namespace std;
typedef int var;

struct Trie {
    #define P 65536


    struct node {unordered_map<int, node*> leg; bool good;};
    typedef node* pnod;
    node *root = new node;

    void insert(pnod &x, int val) {
        if(!x) x = new node;
        if(!val) x->good = 1;
        else insert(x->leg[val % P], val / P);
    }

    void erase(pnod &x, int val) {
        if(!x) return;
        if(!val) x->good = 0;
        else erase(x->leg[val % P], val / P);
    }

    bool find(pnod &x, int val) {
        if(!x) return 0;
        if(!val) return x->good;
        return find(x->leg[val % P], val / P);
    }
};
Trie T;

#define isdigit(c) (c>='0'&&c<='9')
struct Scanner {
    #define DIM 100000
    char buff[DIM];
    int poz = DIM - 1;
    bool sign;

    Scanner& operator >> (var &a) {
        #define adv() (++poz == DIM) ? fread(buff, 1, DIM, stdin), poz=0 : 0
        for(sign = 0; !isdigit(buff[poz]) && buff[poz] != '-'; adv());
        if(buff[poz] == '-') sign = 1, adv();
        for(a = 0; isdigit(buff[poz]); a = a * 10 + buff[poz] - '0', adv());
        if(sign) a = -a;

        return *this;
    }
};
Scanner in;

int main() {
    freopen("hashuri.in", "r", stdin);
    freopen("hashuri.out", "w", stdout);

    int m, t, a;
    in >> m;
    while(m--) {
        in >> t >> a;
        if(t == 1) T.insert(T.root, a);
        if(t == 2) T.erase(T.root, a);
        if(t == 3) printf("%d\n", T.find(T.root, a));
    }

    return 0;
}