#include <bits/stdc++.h>
#define PRIM 123457

using namespace std;

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

vector <int> L[PRIM];
int n;

void Inserare (int x)
{
    int r;
    r = x % PRIM;
    L[r].push_back (x);
}

void Sterge (int x)
{
    int r;
    r = x % PRIM;

    for (int j = 0; j < L[r].size(); j++)
        if (L[r][j] == x)
    {
        L[r].erase (L[r].begin() + j);
    }
}

bool Cauta (int x)
{
    int r;

    r = x % PRIM;

    for (int j = 0; j < L[r].size(); j++)
            if (L[r][j] == x)
                return 1;
    return 0;
}
void Read ()
{
    int x, y;
    fin >> n;

    for (int i = 1; i <= n; i++)
    {
        fin >> x >> y;

        if (x == 1)
        {
            Inserare(y);
        }
        if (x == 2)
        {
            Sterge(y);
        }
        if (x == 3)
        {
            fout << Cauta(y) << "\n";
        }
    }
}
int main()
{
    Read();
    return 0;
}