#include<cstdio>
#define MOD 131019
using namespace std;

struct node {
    int val;
    node* next;
};

node* Hash[MOD];

inline int h(int x) {
    return x % MOD;
}

inline bool searchElem(int x) {
    node* p = Hash[h(x)];
    while(p != NULL && p->val != x)
        p = p->next;
    return (p != NULL ? 1 : 0);
}

inline void insertElem(int x) {
    int k = h(x);
    node* elem = new node;
    elem->val = x;
    elem->next = Hash[k];
    Hash[k] = elem;
}

void deleteElem(int x) {
    node* p, *q;
    int k = h(x);
    if(Hash[k]->val == x) {
        p = Hash[k];
        Hash[k] = Hash[k]->next;
        delete p;
    } else {
        p = Hash[k];
        while(p->next->val != x)
            p = p->next;
        q = p->next;
        p->next = p->next->next;
        delete q;
    }
}

int main() {
    printf("%d",sizeof(Hash));
    int n, x, op, i;
    FILE* fin, *fout;
    fin = fopen("hashuri.in","r");
    fout = fopen("hashuri.out","w");
    fscanf(fin,"%d",&n);
    for(i = 1; i <= n; i++) {
        fscanf(fin,"%d%d",&op,&x);
        if(op == 1) {
            if(!searchElem(x))
                insertElem(x);
        } else if(op == 2) {
            if(searchElem(x))
                deleteElem(x);
        } else fprintf(fout,"%d\n",searchElem(x));
    }
    fclose(fin);
    fclose(fout);
    return 0;
}