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

const int mod = 1000003;
vector<int> a[mod];
vector<int>::iterator it;

bool find(int i, int x)
{
	for (it = a[i].begin(); it != a[i].end(); ++it)
		if (*it == x)
			return true;
	return false;
}

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

	int n;
	fin >> n;
	int op, x, k;
	bool in;
	for (int i = 0; i < n; ++i) {
		fin >> op >> x;
		k = x%mod;
		in = find(k,x);
		if (op == 1 && !in) a[k].push_back(x);
		if (op == 2 && in) a[k].erase(it);
		if (op == 3) fout << in << '\n';
	}
	return 0;
}