#include <iostream>
#include <fstream>
using namespace std;

#define m 666013

struct nod
{
	int inf;
	nod *adr;
}*l[m];

void add(int x)
{
	const int mod = x%m;
	if (l[mod] == NULL)
	{
		l[mod] = new nod;
		l[mod]->adr = new nod;
		l[mod]->adr->inf = x;
		l[mod]->adr->adr = NULL;
		return;
	}
	nod *p = l[mod]->adr;
	while (p) 
	{
		if (p->inf == x) return;
		p = p->adr;
	}
	p = new nod;
	p->inf = x; p->adr = NULL;
}


void del(int x)
{
	const int mod = x%m;
	if (l[mod] == NULL) return;
	nod *p = l[mod];
	while (p->adr && p->adr->inf != x)
		p = p->adr;
	if (p->adr == NULL) return;
	nod *aux = p->adr;
	p->adr = aux->adr;
	delete aux;
}

bool search(int x)
{
	const int mod = x%m;
	if (l[mod] == NULL) return false;
	nod *p = l[mod]->adr;
	while (p)
	{
		if (p->inf == x) return true;
		p = p->adr;
	}
	return false;
}

int main()
{
	ifstream in("hashuri.in"); ofstream out("hashuri.out");
	int n, i, c, x;
	in>>n;
	for (i=0;i<n;i++)
	{
		in>>c>>x;
		switch (c)
		{
			case 1: add(x); break;
			case 2: del(x); break;
			case 3: out<<search(x)<<endl; break;
		}
	}
	return 0;
}