#include <stdio.h>
#include <algorithm>
#include <map>

using namespace std;

int main()
{
	int i, N, op, x, nr = 0;
	map<int, int> myset;

	freopen("hashuri.in", "r", stdin);
    freopen("hashuri.out", "w", stdout);
	
	scanf("%d", &N);

	for(i = 1; i <= N; ++i)
	{
		scanf("%d%d", &op, &x);
		switch(op)
		{
		case 1:
			if(myset.find(x)== myset.end())
				myset[x] = ++nr;
			break;
		case 2:
			myset.erase(x);
			break;
		case 3:
			printf("%d\n", myset.find(x) != myset.end());
			break;
		}
	}

	return 0;
}