#include<cstdio>
#define mod 666013
using namespace std;
int k,val[1000001],lst[mod+1],nxt[1000001];
int cauta(int x)
{
    int p=lst[x%mod];
    while(p!=0)
    {
        if(val[p]==x)
        {
            return p;
        }
        p=nxt[p];
    }
    return 0;
}
void adauga(int x)
{
    if(cauta(x))
        return;
    int r=x%mod;
    k++;
    val[k]=x;
    nxt[k]=lst[r];
    lst[r]=k;
}
void sterge(int x)
{
    int p=cauta(x);
    if(p!=0)
        val[p]=-1;
}
int main()
{
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);
    int n,i,c,x,d;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d%d",&c,&x);
        if(c==1)
        {
            adauga(x);
        }
        else
        {
            if(c==2)
            {
                sterge(x);
            }
            else
            {
                d=cauta(x);
                if(d>0)
                    printf("1\n");
                else
                    printf("0\n");
            }
        }
    }
    return 0;
}