#include <bits/stdc++.h>

using namespace std;

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

int n, q, v[1000005], nxt[1000005], L[666016], x;
const int MOD = 666013;

inline int caut(int x)
{
    int p = L[x%MOD];
    while(p)
        if(v[p] == x) return 1;
        else p = nxt[p];
    return 0;
}

inline void sterg(int x)
{
    int p = L[x%MOD];
    if(v[p] == x) L[x%MOD] = nxt[L[x%MOD]];
    while(nxt[p])
        if(v[p] == x)
        {
            nxt[p] = nxt[nxt[p]];
            return;
        }
        else p = nxt[p];
}

int main()
{
    F >> n;
    for(int i = 1; i <= n; ++ i)
    {
        F >> q >> x;
        if(q == 1 && !caut(x))
        {
            v[i] = x;
            nxt[i] = L[v[i]%MOD];
            L[v[i]%MOD] = i;
        }
        else
        {
            if(caut(x))
            {
                if(q == 3) G << "1\n";
                else sterg(x);
            }
            else if(q == 3) G << "0\n";
        }
    }
    return 0;
}