#include <fstream>
#include <vector>
# define prim 700001
using namespace std;
vector <int> h[prim];

vector <int>::iterator find(int x){
	vector<int>::iterator iter;     
	int p=x%prim;                	
	for (iter=h[p].begin();iter!=h[p].end();++iter)    
		if (*iter==x)      
			return iter;  
	return h[p].end();    
}


int main(){
	int n,op,x,i;
	ifstream f ("hashuri.in");
	ofstream g ("hashuri.out");
	f>>n;
	for (i=0;i<n;i++){
		f>>op>>x;
		if (op==1)
			if(find(x)==h[x%prim].end())//if x doesn't already exists
				h[x%prim].push_back(x);
	    if (op==2){
			vector <int>::iterator iter;
			iter=find(x);
			if(iter!=h[x%prim].end())//if x exists
				h[x%prim].erase(iter);
		}
		if (op==3){
			if(find(x)==h[x%prim].end())
				g<<"0"<<endl;
			else
				g<<"1"<<endl;
		}
	}
	return 0;
}