#include <fstream>
#include <vector>
#define mod 999983
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector< vector<int> > a;
int n, i, op, x;
void insert_in( int x )
{
    int place = x % mod;
    a[place].push_back(x);
}

void erase_in( int x )
{
    int place = x % mod;
    for (int  i = 0 ; i < a[place].size() ;  i++ )
    if ( a[place][i] == x )
    {
        a[place].erase(a[place].begin()+i);
        return;
    }
}

bool query( int x)
{
    int place = x % mod;
    for (int  i = 0 ; i < a[place].size() ; i++ )
        if ( a[place][i] == x )
        return 1 ;
    return 0;



}

int main()
{
    f >> n;
    a = vector< vector<int> >(mod);
    for (int i = 1, x, op ; i <= n ; i++ )
    {
        f >> op >> x;
        if ( op == 1 ) insert_in(x);
        else
        if ( op == 2 ) erase_in(x);
        else
            g << query(x) << "\n";
    }
    return 0;
}