#include <stdio.h>
#include <stdlib.h>
#include <map>
#include <set>
#include <fstream>
#include <vector>

#define p 1000001

int main () {
    int numberOfTests;
    int operationKind;
    long long int element;
    std::map<int, std::set<long long int>> elements;
    std::ifstream in("hashuri.in");
    std::ofstream out("hashuri.out");

    in >> numberOfTests;

    for (int i = 0; i < numberOfTests; i++) {
        in >> operationKind >> element;
        switch (operationKind) {
            case 1:
                elements[element % p].insert(element);
                break;
            case 2:
                elements[element % p].erase(element);
                break;
            case 3:
                out << (elements[element % p].find(element) != elements[element % p].end()) << "\n";
                break;
            default:
                break;
        }
    }

    return 0;
}