#include <fstream>
#include <unordered_map>

using namespace std;

ifstream fin("hashuri.in");
ofstream fout("hashuri.out");

int N, NR;
unordered_map <int, int> M;

int main()
{
    int i, tip, x;

    fin>>N;

    for (i = 1; i <= N; i++)
    {
        fin>>tip>>x;
        if (tip == 1 && M.find(x)==M.end()) M[x] = ++NR;
        if (tip == 2) M.erase(x);
        if (tip == 3)
        {
            if(M.find(x)!=M.end())
                fout<<1<<'\n';
            else
                fout<<0<<'\n';
        }
    }

    return 0;
}