#include<cstdio>
#include<vector>
#define prim 666013
using namespace std;
FILE *f=fopen("hashuri.in","r");
FILE *g=fopen("hashuri.out","w");
vector<int>hasis[prim];
int arr,n,j,i,x,cer,ok;
int cauta(int x)
{
    arr=x%prim;
    for(j=0;j<hasis[arr].size();j++)
        if(hasis[arr][j]==x)
            return 1;
    return 0;
}
int main()
{
    fscanf(f,"%d",&n);
    for(i=1;i<=n;i++)
    {
        fscanf(f,"%d%d",&cer,&x);
        if(cer==1)
        {
            hasis[x%prim].push_back(x);
        }
        else
            if(cer==2)
            {
                arr=x%prim;
                for(j=0;j<hasis[arr].size();j++)
                    if(hasis[arr][j]==x)
                        hasis[arr].erase(hasis[arr].begin()+j);
            }
            else
            {
                ok=cauta(x);
                if(ok==1)
                    fprintf(g,"1\n");
                else fprintf(g,"0\n");
            }
    }
    return 0;
}