#include <fstream>
#include <vector>
#define MOD 666013
#define pb push_back
using namespace std;

vector <int> v[MOD];
vector <int>::iterator it;
int i,o,x,n;
ifstream f ("hashuri.in");
ofstream g ("hashuri.out");
void insertv (int x)
{
	int ind = x % MOD;
	v[ind].pb(x);
}

void deletev (int x)
{
	int ind = x % MOD;
	for (it=v[ind].begin(); it!=v[ind].end(); it++)
		if (*it == x) 
		{
			v[ind].erase (it);
			return;
		}
}

bool find (vector <int> v[MOD],int x)
{
	int ind=x % MOD;
	int len = v[ind].size();
	for (i=0; i<len; i++)
		if (v[ind][i] == x) return true;
	return false;
}

int main ()
{
	f >> n;
	for (i=1; i<=n; i++)
	{
		f >> o >> x;
		if (o==1) insertv (x);
		if (o==2) if (find (v,x)) deletev (x);
		if (o==3) if (find (v,x)) g <<"1"<<endl;
					else g<<"0"<<endl;
	}
	return 0;
}