#include <fstream>
#include <unordered_map>
using namespace std;
ifstream in ("hashuri.in");
ofstream out ("hashuri.out");
unordered_map <int, int> a;
unordered_map <int, int>::iterator b;
int n,k,nr;
int main()
{
    int n;
    in>>n;
    for (int i=1;i<=n;++i)
    {
        in>>k>>nr;
        if (k==1)
            a.insert(make_pair(nr,1));
        if (k==2)
        {
            b=a.find(nr);
            if (b!=a.end());
                a.erase(nr);
        }
        if (k==3)
        {
            b=a.find(nr);
            if (b!=a.end())
                out<<1<<'\n';
            else
                out<<0<<'\n';
        }
    }
    return 0;
}