#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

const int mod = 705949;
int N, op;
vector<int> v[mod];

int find_value(int x)
{
	int x_h = x % mod;
	for (int i = 0; i < v[x_h].size(); i++)
		if (v[x_h][i] == x)
			return i;
	return -1;
}

void insert_value(int x)
{
	int x_h = x % mod;
	if (find_value(x) == -1)
		v[x_h].push_back(x);
}

void delete_value(int x)
{
	int x_h = x % mod;
	int i = find_value(x);
	if (i != -1)
		v[x_h].erase(v[x_h].begin() + i - 1);
}
int main()
{
	ifstream f("hashuri.in");
	ofstream o("hashuri.out");
	int x;
	f >> N;
	for (int i = 0; i < N; i++)
	{
		f >> op >> x;
		if (op == 1)
			insert_value(x);
		if (op == 2)
			delete_value(x);
		if (op == 3)
			if (find_value(x) == -1)
				o << '0' << endl;
			else
				o << '1' << endl;
	}
}