//ALEX ENACHE

#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>

using namespace std;

//-----------------------------------------------------------------

#include <fstream>

//ifstream cin("input"); ofstream cout("output");
ifstream cin("hashuri.in"); ofstream cout("hashuri.out");

const int MOD = 1e5 + 3;
vector < int > v[MOD];

int query(int n) {
	int rest = n % MOD;
	for (auto& x : v[rest]) {
		if (x == n) {
			return 1;
		}
	}
	return 0;
}

void add(int n) {
	int rest = n % MOD;
	if (!query(n)) {
		v[rest].push_back(n);
	}
}

void erase(int n) {
	int rest = n % MOD;
	vector < int > now;
	for (auto& x : v[rest]) {
		if (x != n) {
			now.push_back(x);
		}
	}
	v[rest] = now;
}



int main() {

	int t;
	cin >> t;

	while (t--) {
		int q, n;
		cin >> q >> n;	
		if (q == 1) {
			add(n);
		}
		if (q == 2) {
			erase(n);
		}
		if (q == 3){
			cout << query(n) << '\n';
		}
	}

	return 0;
}