#include <map>
#include <fstream>
using namespace std;
ifstream f( "hashuri.in" );
ofstream g( "hashuri.out" );
int N, elem, tip, x, i;
map <int, int> harta;
int main()
{
    f >> N;
    for (i = 1; i <= N; i++){
        f >> tip >> x;
        switch ( tip ){
            case 1:
                if(harta.find(x) == harta.end() )
                    harta[x]= elem;
                break;
            case 2:
                harta.erase(x);
                break;
            case 3:
                if( harta.find(x) == harta.end() )
                    g << "0\n";
                else
                    g << "1\n";
                break;
        }
    }
}