#include <fstream>
#include <vector>
#define mod 576101
typedef unsigned long long ll;
using namespace std;

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

vector<ll> a[mod];
int n;

bool find(ll b) {
	int m = b % mod, i = 0;
	while(i < a[m].size() && a[m][i] != b)
		i++;
	return i;
}

void push(ll h) {
	if(find(h) == a[h % mod].size())
		a[h % mod].push_back(h);
}

void pop(ll h) {
	int it = find(h), m = h % mod;
	if(it != a[m].size())
		a[m].erase(a[m].begin() + it);
}

int main() {
	cin >> n;
	while(n--) {
		ll h;
		int cer;
		cin >> cer >> h;
		switch(cer) {
			case 1:
				push(h);
				break;
			case 2:
				pop(h);
				break;
			case 3:
				cout << (find(h) != a[h % mod].size()) << '\n';
				break;
		}
	}
	return 0;
}