/*
    Look at me!
    Look at me!
    Look at how large the monster inside me has become!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define ull unsigned long long
#define mod 10067
#define MOD 32416190071
#define N 200100
#define M 5500010
#define SQR 350
#define inf 1<<30
#define eps 1.e-9
using namespace std;

ifstream f("hashuri.in");
ofstream g("hashuri.out");

int t,x,n;

struct Tr
{
    Tr *l, *r;
    int pr,k;
    Tr(int _k)
    {
        pr=rand();
        k=_k;
        l=r=NULL;
    }
};
#define T Tr*
T R;
void split(T t,T &l,T &r,int k)
{
    if(!t)
    {
        l=r=t;
        return ;
    }
    if(k<=t->k)
        split(t->l,l,t->l,k),r=t;
    else
        split(t->r,t->r,r,k),l=t;
}
void merge(T &t,T l,T r)
{
    if(!l||!r)
    {
        t=l?l:r;
        return ;
    }
    if(l->pr>r->pr)
        merge(l->r,l->r,r),t=l;
    else
        merge(r->l,l,r->l),t=r;
}
void insert(T &t,T it)
{
    if(!t)
    {
        t=it;
        return ;
    }
    if(it->pr>t->pr)
        split(t,it->l,it->r,it->k),t=it;
    else
    if(it->k<t->k)
        insert(t->l,it);
    else
        insert(t->r,it);
}
void erase(T &t,int k)
{
    if(!t)
        return ;
    if(t->k==k)
        merge(t,t->l,t->r);
    else
    if(k<t->k)
        erase(t->l,k);
    else
        erase(t->r,k);
}
int find(T t,int k)
{
    if(!t)
        return 0;
    if(t->k==k)
        return 1;
    if(k<t->k)
        return find(t->l,k);
    else
        return find(t->r,k);
}
int main ()
{
    f>>n;
    while(n--)
    {
        f>>t;
        if(t==1)
        {
            f>>x;
            if(!find(R,x))
            {
                Tr *it=new Tr(x);
                insert(R,it);
            }
        }
        else
        if(t==2)
        {
            f>>x;
            erase(R,x);
        }
        else
        {
            f>>x;
            g<<find(R,x)<<"\n";
        }
    }





    return 0;
}