#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std ;

#define maxn 1000001
#define mod 1000013

int n ;
vector <int> v[maxn] ;

int main()
{
	
	freopen("hashuri.in", "r", stdin);
	freopen("hashuri.out", "w", stdout);
	
	scanf("%d", &n);
	
	for( int i = 1 ; i <= n ; ++ i )
	{
		
		int op, x ;
		
		scanf("%d%d", &op, &x);
		
		int r = x % mod ;
		int end = v[r].size() - 1 ;
		
		if( op == 1 )
			v[x % mod].push_back( x ) ;
		
		if( op == 2 )
		{
			
			for( int j = 0 ; j <= end ; ++ j )
			{	
				if( v[r][j] == x )
				{
					v[r][j] = v[r][end] ;
					v[r].pop_back() ;
					break ;
				}	
			}		
			
		}
		
		if( op == 3 )
		{
			
			bool ok = false ;
			for( int j = 0 ; j <= end ; ++ j )
			{
				if( v[r][j] == x )
				{
					ok = true ;
					break ;
				}	
			}
			
			printf("%d\n", ok);
				
		}	
		
	}	
	
	return 0;
	
}