#include <fstream>
#include <time.h>
#include <stdlib.h>
#define RM 79
#define C1 1011237
#define C2 812041
#define T1 370000
#define T2 680000
#define SZ 1800000
using namespace std;

ifstream in("hashuri.in");
ofstream out("hashuri.out");

int Disp1, Disp2,A,B;
int *Hash1, *Hash2;

inline void Generate()
{
    Disp1 = C1 + rand()%T1;
    Disp2 = C2 + rand()%T2;
    A = 1 + rand()%T1;
    B = 1 + rand()%T2;
}

inline int F1(int nr)
{
    return (((long long)A*nr+B)%Disp1);
}

inline int F2(int nr)
{
    return nr%Disp2;
}

inline bool adauga(int nr)
{
    int i,aux;
    for(i=1;i<=RM;i++)
    {
        if(Hash1[F1(nr)] == 0)
        {
            Hash1[F1(nr)] = nr;
            return 1;
        }
        else if(Hash2[F2(nr)] ==0)
        {
            Hash2[F2(nr)] = nr;
            return 1;
        }
        else
        {
            aux = Hash2[F2(nr)];
            Hash2[F2(nr)] = nr;
            nr = aux;
        }
    }
    return 0;
}

inline bool sterge(int nr)
{
    int v1 = F1(nr), v2 = F2(nr);
    if(Hash1[v1] == nr)
    {
        Hash1[v1] = 0;
        return 1;
    }
    if(Hash2[v2] == nr)
    {
        Hash2[v2] = 0;
        return 1;
    }
    return 0;
}

inline bool exista(int nr)
{
    int v1 = F1(nr), v2 = F2(nr);
    if(Hash1[v1] == nr || Hash2[v2] == nr)
        return 1;
    return 0;
}

void Rehash(int K,bool *Op,int *NR)
{
    delete[] Hash1;
    delete[] Hash2;
    Generate();
    Hash1 = new int[Disp1+4];
    Hash2 = new int[Disp2+4];
    for(int i=1;i<=K;i++)
    {
        if(Op[i])
        {
            if(!exista(NR[i]))
             if(!adauga(NR[i]))
             {
                Rehash(K,Op,NR);
                return;
             }
        }
        else sterge(NR[i]);
    }
}

int main()
{
    int N,op,x;
    in>>N;
    srand(time(NULL));
    Generate();
    Hash1 = new int[Disp1+4];
    Hash2 = new int[Disp2+4];
    bool Op[N];int NR[N], K=0;
    while(N--)
    {
        in>>op>>x;
        if(op==1)
        {
            Op[++K] = 1,NR[K] = x;
            if(!exista(x))
                if(!adauga(x))
                    Rehash(K,Op,NR);
        }
        if(op==2)
            Op[++K] = 0,NR[K] = x,sterge(x);
        if(op==3)
            out<<exista(x)<<'\n';
    }
    in.close();
    out.close();
    return 0;
}