#include <iostream>
#include <fstream>
#include <tr1/unordered_set>

using namespace std;
using namespace tr1;

int main() {
    ifstream cin("hashuri.in");
    ofstream cout("hashuri.out");

    int N; cin >> N;
    
    unordered_set<int> S;
    for (int i = 0; i < N; ++i) {
        int a, b; cin >> a >> b;
        if (a == 1)
            S.insert(b);
        if (a == 2)
            S.erase(b);
        if (a == 3) {
            if (S.find(b) != S.end())
                cout << "1\n";
            else
                cout << "0\n";
        }
    }
}