#include <iostream>
#include<fstream>
#include <vector>
#define mod 666013
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");

vector<int>v[mod];


bool gasit(int x )
{
    int lista = x % mod, i;
    int lg = v[lista].size();
    for(i = 0; i < lg; ++i)
        if(v[lista][i] == x)
            return 1;


    return 0;
}

void solve1(int x)///adauga
{
    int lista = x % mod;
    if(!gasit(x))
        v[lista].push_back(x);

}

void solve2(int x)///il sterge
{
    int lista = x % mod, i;
    int lg = v[lista].size();
    for(i = 0; i < lg; ++i)
        if(v[lista][i] == x)///parcurge lista
        {
            v[lista][i] = v[lista][lg - 1];
            v[lista].pop_back();
            break;
        }

}

void solve3(int x)///afiseaza daca este
{
    fout << gasit(x) << "\n";

}

int main()
{
    int op, x, n, i;
    fin >> n;
    for(i = 1; i <= n; ++i)
    {
        fin >> op >> x;
        if(op == 1)solve1(x);
        else if(op == 2)solve2(x);
            else solve3(x);

    }
    return 0;
}