#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream f1("hashuri.in");
ofstream f2("hashuri.out");

int main()
{
    int N;
    int v1;
    int v2;
    f1 >> N;
    unordered_map<int, int> m;

    for (int i = 0; i < N; ++i) {
        f1 >> v1 >> v2;
        if (v1 == 1) {
            m[v2]=1;
        } else if (v1 == 2) {
            m.erase(v2);
        } else{
            int result;
            if (m.find(v2) != m.end()) {
                result = 1;
                }   else {
                    result = 0;
                }
                f2 << result << '\n';}
    }


    f1.close();
    f2.close();

    return 0;
}