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

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

unordered_map <int,int> M;

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