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

using namespace std;

ifstream f ("hashuri.in");
ofstream g ("hashuri.out");

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

void adauga (int el)
{
    int aux;
    aux = el % PRIM;
    v[aux].push_back (el);
}

void sterge (int el)
{
    int aux;
    aux = el % PRIM;

    for (int i= 0; i<v[aux].size();i++)
        if (v[aux][i] == el)
    {
        v[aux].erase (v[aux].begin()+i);
    }
}

bool cauta (int el)
{
    int aux;
    aux = el % PRIM;
    for (int i=0;i<v[aux].size();i++)
            if (v[aux][i]==el)
                return 1;
    return 0;
}
int main()
{
    int x, y;
    f>> n;

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

        if (x == 1)
        {
            adauga(y);
        }
        if (x == 2)
        {
            sterge(y);
        }
        if (x == 3)
        {
            g<< cauta(y)<<endl;
        }
    }

    return 0;
}