#include <bits/stdc++.h>

using namespace std;

ifstream fin( "hashuri.in" );
ofstream fout( "hashuri.out" );

const int MOD = 100003;
int n;
vector <int> Hash[MOD];

bool Hash_check( int val )
{
    int i, mod = val % MOD;
    for ( i = 0; i < Hash[mod].size(); ++i )
         if ( Hash[mod][i] == val )
             return 1;
    return 0;
}

void Hash_add( int val )
{
    if ( !Hash_check(val) )
        Hash[val%MOD].push_back(val);
}

void Hash_del( int val )
{
    int i, mod = val % MOD;
    for ( i = 0; i < Hash[mod].size(); ++i )
         if ( Hash[mod][i] == val )
             { Hash[mod][i] = -1;
               return;
             }
}

void read()
{
    fin >> n;
    int i, op, val;
    for ( i = 1; i <= n; ++i )
         { fin >> op >> val;
           if ( op == 1 ) Hash_add(val);
           if ( op == 2 ) Hash_del(val);
           if ( op == 3 ) fout << Hash_check(val) << '\n';
         }
}

/*bool prim( int x )
{
    if ( x < 2 ) return 0;
    if ( x == 2 ) return 1;
    if ( x % 2 == 0 ) return 0;
    for ( int i = 3; i * i <= x; i += 2 )
         if ( x % i == 0 )
             return 0;
    return 1;
}*/



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