#include <vector>
#include <fstream>


using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");

#define prime 666013
vector <int> H[prime];

int cautare(vector <int> H[prime],int val)
{int rest,i,m;

rest=val%prime;
m=H[rest].size();
for(i=0;i<m;i++)
     if(H[rest][i]==val)
     return i;
     return -1;
     }

void inserare (vector <int> H[prime],int val)
{ int rest=val%prime;

  if(cautare(H,val)>=0)
  return;
  else
     H[rest].push_back(val);
     }

void stergere (vector <int> H[prime], int val)
{int rest=val%prime;
     int cine=cautare(H,val);
     if(cine==-1)
     return;
     H[rest][cine]=H[rest].back();
     H[rest].pop_back();
     }

int main ()
{ int j,n,op,val;
f>>n;
for(j=1;j<=n;j++)
{ f>>op;
f>>val;
                  if(op==1)
                  inserare(H,val);
                  if(op==2)
                  stergere(H,val);
                  if(op==3)
                    if(cautare(H,val)==-1)

                           g<<0;
                           else
                            g<<1;;
                           }
                  f.close();
                  g.close();
                  return 0;}