#include <bits/stdc++.h>

using namespace std;

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

int N, op, x;

unordered_map < int, int > MP;

int main()
{
    fin >> N;
    for (int i = 1; i <= N; i++) {
        fin >> op >> x;
        if (op == 1) {
            MP[x]++;
        }
        else if (op == 2) {
            MP[x] = max(0, MP[x] - 1);
        }
        else if (op == 3) {
            fout << (MP[x] > 0) << "\n";
        }
    }
    return 0;
}