#include <bits/stdc++.h>
#define MOD 666013

using namespace std;

int n;
vector<int> G[MOD];

int search(int x)
{
    int val = x % MOD;

    vector<int>::iterator i;

    for (i = G[val].begin(); i != G[val].end(); ++i)
        if (*i == x)
            return 1;
    return 0;
}

void insert(int x)
{
    int val = x % MOD;

    if (search(x) == 0)
        G[val].push_back(x);
}

void del(int x)
{
    int val = x % MOD;
    vector <int>::iterator i;

    for (i = G[val].begin(); i != G[val].end(); i++)
        if (*i==x)
            {G[val].erase(i);
            break;}
}

int main() {
    int n, x, op;

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

    f >> n;

    for (int i = 0; i < n; i++)
    {
        f >> op;
        f >> x;

        if (op == 1)
            insert(x);
        else
            if (op == 2)
                {if (search(x))
                    del(x);}
            else
                g<<search(x) << "\n";
    }

    return 0;
}