//hashing with open adressing
//h(x) = (h'(x) + r1 * i + r2 * i^2) % M
//Florea Daniel-Ciprian, gr. 135.
#include<iostream>
#include<fstream>
#include<cstdlib>
using namespace std;
const int nmax = 1000003;
int v[nmax],n;
int r1,r2;//random
inline int has (int x, int i) //(dadea erori daca scriam hash)
{
	int rez=abs((x%nmax+r1*i+r2*i*i))%nmax;
	//assert (rez<=nmax && rez>=0);
	return rez;
}
void inserare (int x)
{
	int k=0;
	while (v[has(x,k)]!=0 && v[has(x,k)]!=-1 && k<=nmax)
		k++;
	if (k>=n+1) 
	{
		cout<<"Vectorul este plin!"; 
		return;
	}
	v[has(x,k)]=x;
}

void stergere (int x)
{
	int k=0;
	while (v[has(x,k)]!=x && v[has(x,k)]!=0 && k<=nmax) k++;
	if (has(x,k)==0) return;
	else if (k<=n) v[has(x,k)]=-1;
}

bool cautare (int x)
{
	int k=0;
	while (v[has(x,k)]!=x && v[has(x,k)]!=0 && k<=nmax) k++;
	if (k<=n && v[has(x,k)]==x) return 1;
	else return 0;
}


int main ()
{
	//initializam 2 valori random pt functia de hash
	srand(time(NULL));
	r1=rand()%nmax;
	r2=rand()%nmax;
	
	ifstream fin ("hashuri.in");
	ofstream fout ("hashuri.out");
	int op,x;
	fin>>n;
	for (int i=1;i<=n;i++)
	{
		fin>>op>>x;
		if (op==1) if (!cautare(x)) inserare(x);
		else if (op==2) stergere(x);
		else fout<<cautare(x)<<'\n';
	}
	fin.close();
	fout.close();
	return 0;
}