#include <stdio.h>
#include <map>

using namespace std;

long n, x, i, t, v;
map <long, long> m;

int main() {
	freopen("hashuri.in", "r", stdin);
	freopen("hashuri.out", "w", stdout);
	
	scanf("%ld", &n);
	for (i = 1; i <= n; ++i) {
		scanf("%ld %ld", &t, &v);
		if (t == 1 && m.find(v) == m.end()) m[v] = ++x;
		if (t == 2) m.erase(v);
		if (t == 3) {
			if (m.find(v) == m.end()) printf("0\n");
			else printf("1\n");
		}
	}
	return 0;
}