#include <bits/stdc++.h>
#define mod 168457
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n, op, x;
vector<int> vec[mod];

int cautare(int n)
{
    int i = n % mod;
    vector<int>::iterator it;
    for (it = vec[i].begin(); it != vec[i].end(); ++it)

        if (*it == n)
            return 1;
    return 0;
}

void adauga(int n)
{
    int i = n % mod;
    if (!cautare(n))
        vec[i].push_back(n);
}


void stergere(int n)
{
    int i = n % mod;
    vector<int>::iterator it;
    for (it = vec[i].begin(); it != vec[i].end(); it++)
        if (*it == n)
        {
            vec[n % mod].erase(it);
            break;
        }


}
int main()
{
    f >> n;
    for (int i = 1; i <= n; i++)
    {
        f >> op >> x;
        if (op == 1)
            adauga(x);
        else if (op == 2)
        {

            if (cautare(x))
                stergere(x);
        }
        else g << cautare(x) << '\n';
    }
    return 0;
}