#include<vector>
#include<fstream>
#define prim 666013
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> v[prim];
int n;

int verif(int b){
  int n,j;
  n=b%prim;
  for(j=0;j<v[n].size();j++)
  if(b==v[n][j])return j;
  return -1;
}
void stergere(int b){
  if(verif(b)!=-1){
    v[b%prim][verif(b)]=v[b%prim][v[b%prim].size()-1];
    v[b%prim].pop_back();
  }
}
void inserare(int b){
  v[b%prim].push_back(b);
}
int main()
{
f>>n;
int op,x;

for(int i=1;i<=n;i++){
  f>>op>>x;
  if(op==1)
  inserare(x);
  if(op==2)
  stergere(x);
  if(op==3){
    if(verif(x)!=-1)g<<"1"<<endl;
    else
    g<<"0"<<endl;
  }
}

return 0;
}