#include <set>
#include <fstream>
using namespace std;

ifstream in("date.in");
ofstream out("date.out");

set<int> H[1000007];
set<int>::iterator it;

int n,i,j,op,val;
int hash_func(int val)
{
    return val%1000007;
}

int main()
{
    in>>n;
    for(i=1; i<=n; i++)
    {
        in>>op>>val;
        if(op == 1)
        {
            /*it = H[hash_func(val)].begin();
            while(*it != val && it != H[hash_func(val)].end())
                it++;
            if(it == H[hash_func(val)].end())
                H[hash_func(val)].push_back(val);//push_back(val);*/
            H[hash_func(val)].insert(val);
        }
        else if(op == 2)
        {
            /*it = H[hash_func(val)].begin();
            while(*it != val && it != H[hash_func(val)].end())
                it++;
            if(it != H[hash_func(val)].end())
                H[hash_func(val)].erase(it);*/
            H[hash_func(val)].erase(val);
        }
        else if(op == 3)
        {
            /*it = H[hash_func(val)].begin();
            while(*it != val && it != H[hash_func(val)].end())
                it++;
            out <<(it != H[hash_func(val)].end())<<'\n';
             */
            out << (H[hash_func(val)].find(val) != H[hash_func(val)].end()) << '\n';
        }
    }
    return 0;
}