#include <stdio.h>
#include <vector>
using namespace std;
#define MOD 666013

int N;
vector <int> arr[MOD];

inline vector<int>::iterator find_value(int x)
{
int list = x % MOD;
	vector<int>::iterator it;
	
	for (it = arr[list].begin(); it != arr[list].end(); ++it)
		if (*it == x)
			return it;

	return arr[list].end();
}

inline void insert_value(int x)
{
	int list = x % MOD;
	if (find_value(x) == arr[list].end())
		arr[list].push_back(x);
}

inline void erase_value(int x)
{
	int list = x % MOD;
	vector<int>::iterator it = find_value(x);
	if (it != arr[list].end())
		arr[list].erase(it);
}

int main()
{
	int op, x;
	freopen("hashuri.in", "r", stdin);
	freopen("hashuri.out", "w", stdout);
	
	for (scanf("%d", &N); N; --N)
	{
		scanf("%d %d", &op, &x);
		if (op == 1) // inserare
		{
			insert_value(x);
			continue;
		}
		
		if (op == 2) // stergere
		{
			erase_value(x);
			continue;
		}
		
		printf("%d\n", find_value(x) != arr[x % MOD].end());
	}
	return 0;
}