#include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

const int bestNrPrim = 666013;
vector<vector<int>> v;
int main()
{
    v.resize(bestNrPrim);
    ifstream cin("hashuri.in");
    ofstream cout("hashuri.out");

    int oculta,n, s, numar = 0;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> s >> numar;
        oculta = numar % bestNrPrim;
        if (s == 1)
        {
            
                v[oculta].push_back(numar);
            
        }
        else if (s == 2)
        {
            auto rez = find_if(v[oculta].begin(), v[oculta].end(), [&](const auto &c)
                               { return c == numar; });

            if (rez != v[oculta].end())
            {
                v[oculta].erase(rez);
            }
        }
        else
        {

            auto rez = find_if(v[oculta].begin(), v[oculta].end(), [&](const auto &c)
                               { return c == numar; });

            if (rez != v[oculta].end())
            {
                cout << 1 << '\n';
            }
            else
                cout << 0 << '\n';
        }
    }

    return 0;
}