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

const int n_max = 100000;
vector <int> v[n_max];
vector <int>::iterator it;

int find(int x)
{
	int l = x%n_max;
	for (it = v[l].begin(); it!=v[l].end(); ++it)
		if (*it == x)
			return 1;
	return 0;
}

int erase(int x)
{
	int l = x%n_max;
	for (it = v[l].begin(); it!=v[l].end(); ++it)
		if (*it == x)
			*it = -1;
}
int main()
{
	int n, c, x;
	freopen("hashuri.in","r",stdin);
	freopen("hashuri.out","w",stdout);
	scanf("%d\n", &n);
	for (int i = 1; i <= n; ++i)
	{
		scanf("%d %d\n", &c, &x);
		
		if (c == 1)
			v[x%n_max].push_back(x);
		if (c == 2)
			erase(x);
		if (c == 3)
			printf("%d\n",find(x) );
	}
	return 0;
}