#include <fstream>
#define NMax 1000005
using namespace std;
ifstream f("hashuri.in"); ofstream g("hashuri.out");
int N, M[NMax], sz;
inline int cauta(int x)
{   for (int i = 0; i < sz; ++i) if (M[i] == x) return i;
    return -1;
}
inline void adauga(int x)
{   if (cauta(x) == -1) M[sz++] = x;
}
inline void sterge(int x)
{   int p = cauta(x);
    if (p == -1) return ;
    for (int i = p; i < sz-1; ++i) M[i] = M[i+1];
    --sz;        
}
int main()
{   int op, x;
	f>>N;
    for (; N; --N)
    { 	f>>op>>x;
        if (op == 1) {adauga(x); continue;}        
        if (op == 2) {sterge(x); continue;}
		if (cauta(x) == -1) g<<"0\n"; else g<<"1\n";
    }
    g.close(); return 0;
}