#include<stdio.h>
#include<stdlib.h>
#include<math.h>
struct point 
{
	int x;
	point *y;
};
point *a[1000000],*p;
int m,n,i,j,c,x,o,f,max;
int h(int k)
{
	float c;
	c=(sqrt(5)-1)/2;
	return (int)(m*((k*c)-(int)(k*c)));
}
int search(int k)
{
	int q;
	point *p;
	q=h(k);
	p=a[q];
	
	while(p)
	{
		if(p->x==k)return 1;
		p=p->y;
	}
	return 0;
}
void intro(int k)
{
	point *p;
	int q;
	q=h(k);
	if(q>max)max=q;
	p=new point;
	p->x=k;
	p->y=a[q];
	a[q]=p;
}
void del(int k)
{
	int q;
	q=h(k);
	if(a[q]->x==k){a[q]=a[q]->y;return;}
	point *p;
	p=a[q];
	while(p->y){if(p->y->x==k){p->y=p->y->y;return;}p=p->y;}
}
int main()
{
	freopen("hashuri.in","r",stdin);
	freopen("hashuri.out","w",stdout);
	scanf("%d",&c);
	m=c/3;
	for(j=0;j<c;j++)
	{
		scanf("%d%d",&o,&x);
		f=search(x);
		if(o==1)if(!f)intro(x);
		if(o==2)if(f)del(x);
		if(o==3)printf("%d\n",f);
		/*for(i=0;i<=max;i++)
		{
			p=a[i];
			while(p){printf("%d  ",p->x);p=p->y;}
			printf("\n");
		}
		printf("\n\n\n");*/
		
	}
	return 0;
}