#include <fstream>
#include <vector>

#define MOD 666013

int N;
std::vector<int> G[MOD];

std::ifstream f("hashuri.in");
std::ofstream g("hashuri.out");

inline std::vector<int>::iterator find_value(int x) {
    int list = x % MOD; //hash function

    std::vector<int>::iterator it;

    for (it = G[list].begin(); it != G[list].end(); it++)
        if (*it == x)
            return it;
    return G[list].end();
}
inline void inser_value(int x) {
    int list = x % MOD; //hash
    
    if (find_value(x) == G[list].end())
        G[list].push_back(x);
}
inline void erase_value(int x) {
    int list = x % MOD;
    std::vector<int>::iterator it = find_value(x);

    if (it != G[list].end())
        G[list].erase(it);
}
int main()
{
    int n;
    f >> n;
    int tip;
    int x;

    for (int i = 0; i < n; i++) {
        f >> tip;
        f >> x;
        if (tip == 1) {
            inser_value(x);
        }
        if (tip == 2) {
            erase_value(x);
        }
        if (tip == 3) {
            g << (find_value(x) != G[x % MOD].end()) << '\n';
        }
    }

    f.close();
    g.close();
}