#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;

vector <int> h[100001];

int n,i,p,k,pp;

int search(int x)
{
	int r=x%666013;
	for(int i=0;i<h[r].size();i++){
		if(h[r][i]==x){
			return i+1;
		}
	}
	return 0;
}

int main()
{
	freopen("hashuri.in","r",stdin);
	freopen("hashuri.out","w",stdout);
	scanf("%d",&n);
	for(i=1;i<=n;i++){
		scanf("%d%d",&p,&k);
		int b=k%666013;
		if(p==1){
			if(!search(k)){
				h[b].push_back(k);
			}
		}
		if(p==2){
			if(search(k)){
				int poz=search(k)-1;
				swap(h[b][poz],h[b][h[b].size()-1]);
				h[b].pop_back();
			}
		}
		if(p==3){
			if(search(k)){
				printf("1\n");
			}else{
				printf("0\n");
			}
		}
	}
	return 0;
}