#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <list>
#include <set>
using namespace std;
 
# define prim 19937
set <int> h[prim];
 
int main(){
	int n,op,x;
	freopen("hashuri.in", "r", stdin);
	freopen("hashuri.out", "w", stdout);
	scanf("%d", &n);
	while (n){
		n--;
		scanf("%d %d", &op, &x);
		switch(op){
			case 1:{
				h[x%prim].insert(x);
				break;
			}          
			case 2:{
				h[x%prim].erase(x);
				break;
			}
			case 3:{
				if(h[x%prim].find(x)==h[x%prim].end())
					printf("0\n");
				else
					printf("1\n");
				}
		}
	}
	return 0;
}