#include <bits/stdc++.h>

using namespace std;

unordered_map<int, bool> m;

int main()
{
    ifstream f("hashuri.in");
    ofstream g("hashuri.out");

    int n;
    f>>n;
    for(short i=1; i<=n; ++i)
    {
        int com, x;
        f>>com>>x;
        if(com==1)
        {
            if(m.find(x) == m.end())
                m[x]=1;
        }

        else
            if(com == 2)
                m.erase(x);
            else
                if(m.find(x) == m.end())
                    g<<0<<"\n";
                else
                    g<<1<<"\n";

    }
    return 0;
}