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

using namespace std;

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

vector <int> v[666020];

int gogu(int val)
{
    int mod = 666013;
    int r = val % mod;
    for (int i = 0; i < v[r].size(); i++)
        if (v[r][i] == val)
            return i;
    return -1;
}

void petrica(int val)
{
    int mod = 666013;
    int r = val % mod;
    if (gogu(val) == -1)
        v[r].push_back(val);
}

void costache(int val)
{
    int mod = 666013;
    int r = val % mod;
    if (gogu(val) != -1)
        v[r].erase(v[r].begin() + gogu(val));
}

int main()
{
    int mod = 666013, n;
    fin >> n;
    for (int i = 1; i <= n; i++)
    {
        int op, x;
        fin >> op >> x;
        if (op == 1)
            petrica(x);
        else if (op == 2)
            costache(x);
        else
        {
            if(gogu(x) == -1)
                fout << 0 << '\n';
            else
                fout << 1 << '\n';
        }
    }
    return 0;
}