//      hash.cpp
//      
//      Copyright 2010 SpeeDemon <virtualdemon@ubuntu>
//      
//      This program is free software; you can redistribute it and/or modify
//      it under the terms of the GNU General Public License as published by
//      the Free Software Foundation; either version 2 of the License, or
//      (at your option) any later version.
//      
//      This program is distributed in the hope that it will be useful,
//      but WITHOUT ANY WARRANTY; without even the implied warranty of
//      MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//      GNU General Public License for more details.
//      
//      You should have received a copy of the GNU General Public License
//      along with this program; if not, write to the Free Software
//      Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
//      MA 02110-1301, USA.
#include <fstream>
#define Modulo  766021

/*
 * 
 */
using namespace std;
struct vertex
{
	int info;
	vertex* next;
} *L[Modulo];
typedef vertex *list;
inline void push( int pos, int y )
{
	if( y > pos && L[pos] )
	{list q;
		for( q=L[pos]; q && y == q->info; q=q->next )
		if( q )
			return;
	}
	list q;
	q=new vertex;
	q->info=y;
	q->next=L[pos];
	L[pos]=q;
}
inline void pop( int pos, int y )
{
	if( L[pos] )
	{list q;
		if( y == L[pos]->info )
		{
			q=L[pos];
			if( NULL == L[pos]->next )
				L[pos]=NULL;
			else L[pos]=q->next;
			delete q;
			return;
		}
		for( q=L[pos]; q->next && y == q->next->info; q=q->next );
		if( !q->next )
			return;
		list p=q->next;
		q->next=p->next;
		delete p;
	}
}
inline bool find( int pos, int y )
{list q;
	for( q=L[pos]; q ; q=q->next )
		if( y == q->info )
			return true;
	return false;
}
int main()
{int n, x, y;
	ifstream in("hashuri.in");
	ofstream out("hashuri.out");
	in>>n;
	for( ; n; --n )
	{
		in>>x>>y;
		switch( x )
		{
			case 1: push( y%Modulo, y ); break;
			case 2: pop( y%Modulo, y ); break;
			case 3: out<<(find( y%Modulo, y ))<<'\n'; break;
		}
	}
	return 0;
}