#include <fstream>
#include <vector>
#define mod 666013

using namespace std;

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

long n,o,k;
vector<long> a[mod];

int fin(long elem){
  long e=elem % mod,i;
  for (i=0;i<(int)a[e].size();++i)
    if (a[e][i]==elem) return i;
	
  return -1;	
}

int ins(long elem){
  long f=fin(elem);
  if (f==-1){
	   long e=elem % mod;
	   a[e].push_back(elem);
	  }
	
  return 0;	
}

int del(long elem){
  long f=fin(elem);
  if (f!=-1){
	   long e=elem % mod;
	   a[e].erase(a[e].begin()+f);	  
	  }	
	
  return 0;	
}

int main(){
  in >> n;
  for (;n>0;--n){
	   in >> o >> k;
	   if (o==1) ins(k); else
	   if (o==2) del(k); else
	   if (o==3) out << (fin(k)!=-1) << "\n";	  
	  }	
	
  in.close();
  out.close();
	
  return 0;	
}