#include <cstdio>
#include <vector>
#include <algorithm>
#include <bitset>
#define N 5000011
using namespace std;

FILE *in,*out;

vector <int> v[N];
vector <int>::iterator a;
int n,op,nr,h;
int i;

int mod(int x)
{
    return x/N;
}

int main()
{

    in=fopen("hashuri.in","r");
    out=fopen("hashuri.out","w");
    fscanf(in,"%d",&n);
    for(i=1;i<=n;i++)
    {
        fscanf(in,"%d %d",&op,&nr);
        h=mod(nr);
        if (op==1)
        {
            a=find(v[h].begin(),v[h].end(),nr);
            if(a==v[h].end())
                v[h].push_back(nr);
        }
        else if(op==2)
        {
            a=find(v[h].begin(),v[h].end(),nr);
            if(a!=v[h].end())
                v[h].erase(a);
        }
        else if(op==3)
        {
            a=find(v[h].begin(),v[h].end(),nr);
            if(a!=v[h].end())
                fprintf(out,"1\n");
            else
                fprintf(out,"0\n");
        }
    }
    return 0;
}