#include <bits/stdc++.h>
#define MOD 666013
using namespace std;
ifstream in ("hashuri.in");
ofstream out ("hashuri.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()
{
    int i,op,x;
    in>>n;
    for(i=1;i<=n;i++)
        {
            in>>op>>x;
            if(op==1)
                insert_value(x);
            else
                if(op==2)
                    erase_value(x);
                else
                    if(find_value(x)!=G[x%MOD].end())
                        out<<1<<"\n";
                    else
                        out<<0<<"\n";
        }
    return 0;
}