#include<stdio.h>
#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;

#define MOD 49003

#pragma warning(push)
#pragma warning(disable: 4996)

vector<int> liste[MOD];
int indexLista;

bool exista(int element)
{
	indexLista = element % MOD;
	int sizeLista = liste[indexLista].size();

	for (int i = 0; i < sizeLista; ++i)
	{
		if (liste[indexLista][i] == element)
			return true;
	}
	return false;
}

void adaugaElement(int element)
{
	indexLista = element % MOD;

	// nu exista, il adaugam 
	if (!exista(element))
		liste[indexLista].push_back(element);
}

void stergeElement(int element)
{
	indexLista = element % MOD;

	// sterge element din vector
	liste[indexLista].erase(remove(liste[indexLista].begin(), liste[indexLista].end(), element), liste[indexLista].end());
}

int main()
{
	freopen("hashuri.in", "r", stdin);
	freopen("hashuri.out", "w", stdout);

	int nrOperatii;
	int tip, element;

	scanf("%d", &nrOperatii);

	for (int i = 0; i < nrOperatii; ++i)
	{
		scanf("%d%d", &tip, &element);

		if (tip == 1)
		{
			adaugaElement(element);
			continue;
		}
		if (tip == 2)
		{
			stergeElement(element);
			continue;
		}

		if (exista(element))
			printf("1\n");
		else
			printf("0\n");
	}

	return 0;
}

#pragma warning(pop)