#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <deque>
#include <set>
using namespace std;
#define Max 66613

vector<int>g[Max];

vector<int>::iterator find(int x)
{
	int p = x%Max;
	vector<int>::iterator it=g[p].begin();
	while(it!=g[p].end())
	{
		if(*it==x)return it;
		it++;
	}
	return g[p].end();
}

void insert(int x)
{
	int p = x%Max;
	vector<int>::iterator it=find(x);
	if(it==g[p].end())g[p].push_back(x);
}

void erase(int x)
{
	int p = x%Max;
	vector<int>::iterator it=find(x);
	if(it!=g[p].end())g[p].erase(it);
}

int main()
{
	int n,op,x;
	freopen("hashuri.in","r",stdin);
	freopen("hashuri.out","w",stdout);
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
		{
			scanf("%d %d",&op,&x);
			switch(op)
			{
			case 1: insert(x); break;
			case 2: erase(x); break;
			case 3: printf("%d\n",find(x)!=g[x%Max].end());
			}
		}
	return 0;
}