#include <fstream>
#include <vector>
#define MOD 666013

using namespace std;

inline vector <unsigned int> :: iterator find_value (unsigned int x);
inline void insert_value (unsigned int x);
inline void erase_value (unsigned int x);

unsigned int N, x;
unsigned short int op;

vector <unsigned int> G[MOD];
unsigned int i;

int main ()
{
    ifstream fin ("hashuri.in");
    ofstream fout ("hashuri.out");
    fin >> N;
    for (i=1; i<=N; i++)
    {
        fin >> op >> x;
        if (op == 1)
            insert_value(x);
        else if (op == 2)
            erase_value(x);
        else
            fout << (find_value(x)!=G[x%MOD].end()) << '\n';
    }
    fin.close();
    fout.close();
    return 0;
}

inline vector <unsigned int> :: iterator find_value (unsigned int x)
{
    int list = x % MOD;
    vector <unsigned int> :: iterator it;
    for (it=G[list].begin(); it!=G[list].end(); it++)
        if (*it == x)
            return it;
    return G[list].end();
}

inline void insert_value (unsigned int x)
{
    int list = x % MOD;
    if (find_value(x) == G[list].end())
        G[list].push_back(x);
}

inline void erase_value (unsigned int x)
{
    int list = x % MOD;
    vector <unsigned int> :: iterator it = find_value(x);
    if (it != G[list].end())
        G[list].erase(it);
}