#include <iostream>
#include<fstream>
#include <vector>
#define mod 666013;
using namespace std;

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

vector<int>v[1000001];

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

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

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

void solve3(int x)
{
    fout << gasit(x) << "\n";
}

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