#include <fstream>
#include <tr1/unordered_set>

using namespace std;
using namespace tr1;

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

unordered_set <int> h;

int main(  ) {
    int n;
    fin >> n;
    for ( int i = 1; i <= n; ++ i ) {
        int x, y;
        fin >> x >> y;
        if ( x == 1 ) {
            h.insert(y);
        } else if ( x== 2 ) {
            h.erase(y);
        } else {
            fout << (h.find(y)!=h.end()) << "\n";
        }
    }

    return 0;
}