#include<fstream>
#define M 666013
using namespace std;
ifstream f("hashuri.in"); ofstream g("hashuri.out");
struct nod {int e; nod *urm;};
nod *H[M];
void ins(int x)
{   int r=x%M;
    nod *q=new nod;
    q->e=x; q->urm=H[r]; H[r]=q;
}
int caut(int x)
{   nod *q=H[x%M];
    for(;q && q->e!=x;q=q->urm);
    if(q) return 1;
    return 0;
}
void sterg(int x)
{   int r=x%M;
    nod *q=H[r];
    if(H[r]->e == x) {H[r]=H[r]->urm; delete(q);}
    else
    {   nod *p=H[r]->urm;
        for(;p && p->e!=x; q=p, p=p->urm);
        if(p!=NULL) {q->urm = p->urm; delete(p);}
    }
}
int main()
{   int t,op,x;
    f>>t;
    while(t--)
    {   f>>op>>x;
        switch(op)
        {   case 1 : if(!caut(x)) ins(x); break;
            case 2 : if(caut(x)) sterg(x); break;
            case 3 : g<<caut(x)<<'\n';
        }
    }
    g.close(); return 0;
}