#include<iostream>
#include<fstream>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
struct nod{long info;
nod  *next;};
nod *v[666014];
void add(nod *&a,long x)
{
    if(!a)
    {
        a=new nod;
        a->info=x;
        a->next=NULL;
    }
    else
    {

        nod *c=new nod;
        c->info=x;
        c->next=a;
        a=c;
    }
}
void del(nod *&a,long x)
{
    if(a)
    {
        if(a->info==x)
            a=a->next;
        else
        {
            nod *c=a;
            while(c->next && c->next->info!=x)
                c=c->next;
            if(c->next)
                c->next=c->next->next;
        }
    }
}
int search(nod *a,long x)
{
    nod *c=a;
    while(c && c->info!=x)
        c=c->next;
    if(c)
        return 1;
    return 0;
}
int main()
{
    long n,x,y,i;
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>x>>y;
        if(x==1)
        {
            add(v[y%666013],y);
        }
        else
        if(x==2)
        {
            del(v[y%666013],y);
        }
        else
            g<<search(v[y%666013],y)<<endl;
    }
    return 0;
}