#include <iostream>
#include<fstream>
#include<vector>
using namespace std;
#define prime 666013
vector<int>V[prime];
int cauta(int val)
{int x;
x=val%prime;
for(int i=0;i<V[x].size();i++)
    if(V[x][i]==val)
    return i;
return -1;

}

void insereaza(int val)
{if(cauta(val)==-1)
V[val%prime].push_back(val);
return;

}
void sterge(int val)
{int i,r;
i=cauta(val);
if(i==-1)
    return;
r=val%prime;
V[r][i]=V[r].back();
V[r].pop_back();

}


int main()
{int n,op,x,z;
ifstream f("hashuri.in");
ofstream f2("hashuri.out");
f>>n;
for(int i=0;i<n;i++)
{f>>op>>x;
if(op==1)
    insereaza(x);
if(op==2)
   sterge(x);
if(op==3)
{if(cauta(x)==-1)
  f2<<"0\n";
  else
    f2<<"1\n";
}}
f.close();
f2.close();
return 0;}