/*
	http://www.infoarena.ro/problema/hashuri
*/

#define INPUT "hashuri.in"
#define OUTPUT "hashuri.out"
#define MAX 1000001
#define MOD 666013

#include <fstream>
#include <iostream>
using namespace std;

int N;
int H[MAX];

bool exists(int key)
{
	return (H[key % MOD] > 0);
}

void add(int key)
{
	if (!exists(key))
	{
		H[key % MOD] = key;
	}
}

void remove(int key)
{
	if (exists(key))
	{
		H[key % MOD] = 0;
	}
}

int main()
{
	int i, op, x;
	ofstream fout(OUTPUT);
	ifstream fin(INPUT);
	fin >> N;
	for (i = 0; i < N; ++i)
	{
		fin >> op >> x;
		switch (op)
		{
		case 1:
			add(x);
			break;
		case 2:
			remove(x);
			break;
		case 3:
			fout << (int)exists(x) << "\n";
			break;
		}
	}
	fin.close();
	fout.close();
	return 0;
}