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

const int n_max = 10000;
set <int> v[n_max];

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].insert(x);
		if (c == 2)
			v[x%n_max].erase(x);
		if (c == 3)
			printf("%d\n", v[x%n_max].find(x)!=v[x%n_max].end());
	}
	return 0;
}