#include <iostream>
#include <fstream>
#include <vector>
#define MOD 100001
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector<int> set[MOD];
int main() {
	int n;
	f >> n;
	for (int i = 0; i < n; i++) {
		int op, num;
		f >> op >> num;
		int pos = num % MOD;
		if (op == 1) {
			bool alreadyIs = false;
			for (int j = 0; j < set[pos].size(); j++)
				if (set[pos][j] == num) {
					alreadyIs = true;
					break;
				}
			if (!alreadyIs)
				set[pos].push_back(num);
		} else if (op == 2) {
			for (int j = 0; j < set[pos].size(); j++)
				if (set[pos][j] == num) {
					set[pos].erase(set[pos].begin() + j);
					break;
				}
		} else {
			bool found = false;
			for (int j = 0; j < set[pos].size(); j++)
				if (set[pos][j] == num) {
					found = true;
					break;
				}
			if (found) {
				g << "1\n";
			} else {
				g << "0\n";
			}
		}
	}
	return 0;
}