#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
FILE *f,*g;
vector <int> h[65013];
void insert(int x)
{
	int j=x%65013;
	vector<int>::iterator p;
	p=find(h[j].begin(),h[j].end(),x);
	if(p==h[j].end())
		h[j].push_back(x);
}
void del(int x)
{
	int j=x%65013;
	vector<int>::iterator p;
	p=find(h[j].begin(),h[j].end(),x);
	if(p!=h[j].end())
		h[j].erase(p);
}
void find(int x)
{
	int j=x%65013;
	vector<int>::iterator p;
	p=find(h[j].begin(),h[j].end(),x);
	if(p!=h[j].end())
		fprintf(g,"%d\n",1);
	else fprintf(g,"%d\n",0);
}
int main()
{
	int n,a,b;
	register int i;
	f=fopen("hashuri.in","r");
	g=fopen("hashuri.out","w");
	fscanf(f,"%d",&n);
	for(i=0;i<n;++i)
	{
		fscanf(f,"%d %d",&a,&b);
		if(a==1)
			insert(b);
		if(a==2)
			del(b);
		if(a==3)
			find(b);
	}
	fclose(f);
	fclose(g);
}