#include <cstdio>

using namespace std;

const int prim=43,mod=10000000;
int v[mod+10];

void inc(int &a)
{
    if(++a==mod) a=0;
}

int hashcode(int x)
{
    return (1LL*x*prim+1LL*x*(x/prim))%mod;
}

void hash_add(int x)
{
    int a=hashcode(x),i;
    for(i=a;v[i]!=0 && v[i]!=x;inc(i));
    if(v[i]==x) return;
    for(i=a;v[i]>0;inc(i));
    v[i]=x;
}

void hash_erase(int x)
{
    int i;
    for(i=hashcode(x);v[i]!=0 && v[i]!=x;inc(i));
    if(v[i]==x) v[i]=-1;
}

int hash_find(int x)
{
    int i;
    for(i=hashcode(x);v[i]!=0 && v[i]!=x;inc(i));
    return (v[i]==x);
}

int main()
{
    freopen("hashuri.in", "r", stdin);
    freopen("hashuri.out", "w", stdout);
    int n,tip,x;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&tip,&x);
        if(tip==1) hash_add(x);
        else if(tip==2) hash_erase(x);
        else printf("%d\n",hash_find(x));
    }
    return 0;
}