#include <fstream>
#include <unordered_map>

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

/// bool fr[200000001];
///map<int, bool> fr;  /// cheile sunt tinute in ordine crescatoare
/// key, value
unordered_map<int, bool> fr;

int main()
{
    int n;
    fin >> n;
    for(int i = 1; i <= n; ++i) {
        int op, x;
        fin >> op >> x;
        if(op == 1) {
            fr[x] = 1;
        }
        else if(op == 2) {
            if(fr.find(x) != fr.end()) {
                fr.erase(x);
            }
        }
        else {
            if(fr.find(x) != fr.end()) {
                fout << "1\n";
            }
            else {
                fout << "0\n";
            }
        }
    }
    return 0;
}