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

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

unordered_map <int, int> M;
int n, op, x, m;
int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
    {
        fin >> op >> x;
        if(op == 1 && M.find(x) == M.end())
            M[x] == ++m;
        if(op == 2)
            M.erase(x);
        if(op == 3)
            if(M.find(x) == M.end())
                fout << 0 << "\n";
            else fout << 1 << "\n";
    }
    return 0;
}