#include <bits/stdc++.h>
#define mod 666013

using namespace std;

vector <int> h[mod];
vector <int> :: iterator it;

int n,x,op,i,ind;
ifstream f ("hashuri.in");
ofstream g ("hashuri.out");

vector <int> :: iterator FIND(int x)
{
    for(it=h[ind].begin(); it!=h[ind].end(); it++)
        if(*it==x) return it;
    return it;
}

void INSERT (int x)
{
    if(it==h[ind].end()) h[ind].push_back(x);
}

void ERASE (int x)
{
    if(it!=h[ind].end()) h[ind].erase(it);
}

void WRITE (int x)
{
    if(it==h[ind].end()) g<<0<<'\n';
    else
        g<<1<<'\n';
}
int main()
{
    f>>n;
    for(i=1; i<=n; i++)
    {
        f>>op>>x;
        ind=x%mod;
        it=FIND(x);
        if(op==1) INSERT(x);
        if(op==2) ERASE(x);
        if(op==3) WRITE(x);
    }
    return 0;
}