//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 = 1e6 + 3;
map < int, int > M[MOD];

void add(int n) {
	int rest = n % MOD;
	M[rest][n] = 1;
}

void erase(int n) {
	int rest = n % MOD;
	if (M[rest].find(n) != M[rest].end()) {
		M[rest].erase(n);
	}
}

int query(int n) {
	int rest = n % MOD;
	if (M[rest].find(n) != M[rest].end()) {
		return M[rest][n];
	}
}

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;
}