#include <bits/stdc++.h>

using namespace std;

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

int k;
unordered_map <int, int> m;

int main()
{
    int n, p, a;
    in >> n;
    for (int i = 1; i <= n; ++i)
    {
        in >> p >> a;
        if (p == 1)
            m[a] = ++k;
        else if (p == 2)
            m.erase(a);
        else
        {
            if (m.find(a) == m.end())
                out << 0;
            else
                out << 1;
            out << '\n';
        }
    }
    return 0;
}