#include <iostream>
#include <fstream>
#include <deque>
#include <set>
#include <algorithm>
#include <stack>
#include <vector>
#include <iomanip>

#define MOD 666013

using namespace std;

ifstream fin("hashuri.in");
ofstream fout("hashuri.out");

int N;
vector<int> G[MOD];

vector<int>::iterator findValue(int x) {
	int list = x % MOD;
	vector<int>::iterator it;

	for (it = G[list].begin(); it != G[list].end(); ++it)
		if (*it == x)
			return it;

	return G[list].end();
}

void insertValue(int x) {
	int list = x % MOD;

	if (findValue(x) == G[list].end())
		G[list].push_back(x);
}

void eraseValue(int x) {
	int list = x % MOD;
	vector<int>::iterator it = findValue(x);

	if (it != G[list].end())
		G[list].erase(it);
}

int main() {
	int op, x;

	fin >> N;

	for (int i = 0; i < N; ++i) {
		fin >> op >> x;

		if (op == 1)
			insertValue(x);
		if (op == 2)
			eraseValue(x);
		if (op == 3)
			fout << (findValue(x) != G[x % MOD].end()) << "\n";

	}

	return 0;
}