#include <fstream>
#include <vector>
#define rem x%mod
#define mod 666013

using namespace std;
vector <int> H[666013];
int op, x, n;
int search(int x)
{
    for (int i = 0; i < H[rem].size(); i++)
        if (H[rem][i] == x) return i;
    return -1;
}
void add(int x)
{
    H[rem].push_back(x);
}
void Erase(int x)
{
    int poz = 0;
    poz = search(x);
    if (poz == -1) return;
    swap(H[rem][poz], H[rem][H[rem].size()-1]);
    H[rem].pop_back();
}
int main()
{
    ifstream f("hashuri.in");
    ofstream g("hashuri.out");
    f >> n;
    for (int i = 1; i <= n; i++)
    {
        f >> op >> x;
        if (op == 1) add(x);
        if (op == 2) Erase(x);
        if (op == 3)
        {
            if (search(x) == -1) g << "0" << '\n';
                else g << "1" << '\n';
        }
    }
    return 0;
}