#include <fstream>
#include <unordered_set>

using namespace std;

int N;
unordered_set<int> A;

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

    int op, x;

	A.reserve(2004539);
    for (fin >> N; N; --N)
    {
        fin >> op >> x;
        if (op == 1)
        {
            A.insert(x);
            continue;
        }
        if (op == 2)
        {
            A.erase(x);
            continue;
        }
        fout << (A.find(x) != A.end()) << '\n';
    }
    return 0;
}