#include <bits/stdc++.h>

template <int prime>
class HashSet {
public:
    HashSet() {}

    void insert(int value) {
        int v = hash(value), idx = 0;
        while (table[v][idx]) {
            if (table[v][idx] == value) return;
            ++ idx;
        }   table[v][idx] = value;
    }
    void erase(int value) {
        int v = hash(value), idx = 0;
        while (table[v][idx]) {
            if (table[v][idx] == value) while (table[v][idx]) table[v][idx] = table[v][idx+1], ++ idx;
            ++ idx;
        }
    }
    bool contains(int value) {
        int v = hash(value), idx = 0;
        while (table[v][idx]) {
            if (table[v][idx] == value) return true;
            ++ idx;
        }   return false;
    }

private:
    int table[prime][8];
    inline int hash(int x) { return (x%prime + prime)%prime; }
};  HashSet <666013> set;

std::ifstream input ("hashuri.in");
std::ofstream output("hashuri.out");

int main()
{
    int Q;  input >> Q;
    int op, x;
    while (Q--) {
        input >> op >> x;
        if (op == 1) set.insert(x);
        else if (op == 2) set.erase(x);
        else if (op == 3) output << set.contains(x) << '\n';
    }

    return 0;
}