#include<iostream>
#include<fstream>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
struct nod{int info;
nod  *next;};
nod *a;
void add(int x)
{
    nod *c;
    c=new nod;
    c->info=x;
    c->next=a;
    a=c;

}
void del(int x)
{
    if(a->info==x)
        a=a->next;
    else
    {
        nod *c=a;
        while(c->next->info!=x)
            c=c->next;
        c->next=c->next->next;
    }
}
int search(int 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;
    a=new nod;
    a=NULL;
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>x>>y;
        if(x==1)
        {
            if(search(y)==0)
                add(y);
        }
        else
        if(x==2)
        {
            if(search(y)==1)
                del(y);
        }
        else
            g<<search(y)<<endl;

    }
    return 0;
}