#include <cstdio>

using namespace std;
typedef int var;

struct Trie {

    int nodes = 1, root = 1;
    struct node {int leg[2] = {0, 0}; bool good = 0;};
    node T[5000000];

    void insert(int &x, int val) {
        if(!x) x = ++nodes;
        if(!val) T[x].good = 1;
        else insert(T[x].leg[val & 1], val >> 1);
    }

    void erase(int &x, int val) {
        if(!x) return;
        if(!val) T[x].good = 0;
        else erase(T[x].leg[val & 1], val >> 1);
    }

    bool find(int &x, int val) {
        if(!x) return 0;
        if(!val) return T[x].good;
        return find(T[x].leg[val & 1], val >> 1);
    }
};
Trie T;

#define isdigit(c) (c>='0'&&c<='9')
#define gc getchar

char c;
void Read(int &a) {
    for(c = gc(); !isdigit(c); c = gc());
    for(a = 0; isdigit(c); a = (a<<1)+(a<<3)+c-'0', c = gc());
}

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

    int m, t, a;
    Read(m);
    while(m--) {
        Read(t); Read(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;
}