#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

const int prime = 666013;

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

vector<int> v[prime + 4];

int main() {
    int n, code, x;
    fin >> n;

    for (int i = 0; i < prime; i++) {
        v[i].clear();
    }

    for (int i = 0; i < n; i++) {
        fin >> code >> x;
        int key = x % prime;
        bool found = false;
        vector<int>::iterator it;

        for (it = v[key].begin(); it != v[key].end(); ++it) {
            if (*it == x) {
                found = true;
                break;
            }
        }

        if (code == 1) {
            if (!found) {
                v[key].push_back(x);
            }
        } else if (code == 2) {
            if (found) {
                v[key].erase(it);
            }
        } else if (code == 3) {
            fout << (found ? 1 : 0) << '\n';
        }
    }

    fin.close();
    fout.close();

    return 0;
}