#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    unordered_set<int> sir;
    ifstream in("hashuri.in");
    ofstream out("hashuri.out");
    in >> n;
    for(int i = 0; i < n; ++i) {
        int t, x;
        in >> t >> x;
        if(t == 1) {
            if(sir.find(x) == sir.end()) sir.insert(x);
        }
        else if(t == 2) {
            if(sir.find(x) != sir.end()) sir.erase(x);
        }
        else if(t == 3) {
            if(sir.find(x) != sir.end()) {
                out << 1 << "\n";
            }
            else out << 0 << "\n";
        }
    }
    return 0;
}