/* 
 * File:   main.cpp
 * Author: VirtualDemon
 *
 * Created on April 12, 2010, 4:23 PM
 */
#include <cstdlib>
#include <fstream>
#include <tr1/unordered_set>

/*
 * 
 */
using namespace std;
using namespace tr1;
unordered_set< int, hash<int> > s;
int main(int argc, char** argv)
{
    int N, i, j;
    ifstream in( "hashuri.in" );
    ofstream out( "hashuri.out" );
    in>>N;
    for( ; N; --N )
    {
        in>>i>>j;
        switch( i )
        {
            case 1 : s.insert(j); break;
            case 2 : s.erase(j); break;
            case 3 : out<<( s.end() != s.find(j) )<<'\n';
        }
    }
    return EXIT_SUCCESS;
}