#include <fstream>
#include <string.h>
#include <vector>
#include<math.h>
#include <cstdlib>
#include <stdlib.h>
#include <time.h>

using namespace std;

unsigned int* alocare(unsigned int *hash, int mod)
{
    hash = (unsigned int *) malloc (mod * sizeof(unsigned int));
    return hash;
}

bool  adaugare(int a, int b, int c, int d, unsigned int *hash1, unsigned int *hash2, int mod1, int mod2, int val)
{
	int start=0, aux, nr=0, aux2;
	
	if(hash1[(a+b*val)%mod1]==0)
	{
		aux = 0;
		hash1[(a+b*val)%mod1]=val;
	}
	else
	{
		aux=hash2[(c+d*val)%mod2];
		hash2[(c+d*val)%mod2]=val;
	}
		
	
	while(aux!=0 && nr<10)
	{
		aux2=aux;
		if(start==0)
		{
			aux=hash1[(a+b*val)%mod1];
			hash1[(a+b*val)%mod1]=aux2;
			start=1;
		}
		else
		{
			aux=hash2[(c+d*val)%mod2];
			hash2[(c+d*val)%mod2]=aux2;
			start=0;
		}
		nr++;
	}
	if(aux==0)
		return 1;
	return 0;
}		
		
	
void  stergere(int a, int b, int c, int d, unsigned int *hash1, unsigned int *hash2, int mod1, int mod2, int val)
{
	if( ( hash1[(a+b*val)%mod1] == val ) )
		hash1[(a+b*val)%mod1]=0;
		
	else
		if( hash2[(c+d*val)%mod2] == val )
			hash2[(c+d*val)%mod2] = 0;
}

		
bool cautare(int a, int b, int c, int d, unsigned int *hash1, unsigned int *hash2, int mod1, int mod2, int val)
{
	
	if( ( hash1[(a+b*val)%mod1] == val ) || ( hash2[(c+d*val)%mod2] == val ) )
		return 1;
	else
		return 0;
}
	
		
void rezolvare()
{

    unsigned int *hash1, *hash2;
	
	int n, op, val, i, a, b, c, d, mod1, mod2, ok=0, nr1, nr2, size = 1000000;;
	
	int pr[]={666013, 999983,999979,899981,900007,800011, 678077, 678823, 679597, 680347};
	
	srand( time( NULL ) );
	
	hash1 = alocare(hash1, 2*size);
	hash2 = alocare(hash2, 2*size);
	
	while(ok==0)
	{
		a = rand()%10000+1;
		b = rand()%10000+1;
		
		c = rand()%10000+1;
		d = rand()%10000+1;
		
		
		nr1 = rand()%6;
		nr2 = rand()%6;
		
		mod1 = pr[nr1]; 
		mod2 = pr[nr2];
		mod2 = mod1;
		
	
		memset(hash1,0,2*size-20);
		memset(hash1,0,2*size-20);
	
		FILE *f = fopen ("hashuri.in", "r");
		FILE *g = fopen ( "hashuri.out", "w");
	
		fscanf (f,"%d", &n);
		
		ok=1;
	
		for(i=1; i <= n && ok; i++)
		{
			fscanf (f, "%d %d", &op, &val);
		
			if(op==1)
				ok = adaugare(a, b, c, d, hash1, hash2, mod1, mod2, val);
			else
				if(op==2)
					stergere(a, b, c, d, hash1, hash2, mod1, mod2, val);
				else
					fprintf( g,"%d\n", cautare(a, b, c, d, hash1, hash2, mod1, mod2, val));
		}
		
		fclose(f);
		fclose(g);
	}
	
	free(hash1);
	free(hash2);
}

int main()
{
    rezolvare();
	
    return 0;
}