#include <bits/stdc++.h>
#define in "hashuri.in"
#define out "hashuri.out"
#define Nmax 1000003
#define MOD 666013
using namespace std;
ifstream fin(in);
ofstream fout(out);

int n;
vector <int> G[MOD];

inline vector<int>::iterator find_value(int x)
{
     int list = x % MOD;
     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 insert_value(int x)
{
    int list = x % MOD;

    if (find_value(x) == G[list].end())
        G[list].push_back(x);
}

inline void erase_value(int x)
{
    int list = x % MOD;
    vector<int>::iterator it = find_value(x);

    if (it != G[list].end())
        G[list].erase(it);
}


int main()
{
    short op;
    int x,i;

    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
        {
            if (find_value(x) != G[x % MOD].end()) fout << 1 << "\n";
            else fout << 0 << "\n";
        }
    }

    fin.close();
    fout.close();
    return 0;
}