#include <bits/stdc++.h>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector<int> v[200183];
int main()
{
    int n;
    f >> n;
    for (int t, a; n; n--)
    {
        f >> t >> a;
        int md = a % 200183;
        auto it = find(v[md].begin(), v[md].end(), a);
        if (t == 1)
        {
            if (it == v[md].end())
                v[md].push_back(a);
        }
        else if (t == 2)
        {
            if (it != v[md].end())
                v[md].erase(it);
        }
        else
        {
            if (it == v[md].end())
                g << "0\n";
            else
                g << "1\n";
        }
    }
    return 0;
}