#include <iostream>
#include <fstream>

// fara hash tables

#define N 1000005

using namespace std;

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

int n, op, x, v[N], ne;

int cauta(int x)
{
    for (int i=0; i<ne; i++)
      if (v[i]==x) return i;
    return -1;
}

void adauga(int x)
{
    if (cauta(x)==-1) v[ne++]=x;
}

void sterge(int x)
{
    int pos=cauta(x);
    if (pos==-1) return;
    for (int i=pos; i<ne-1; i++) v[i]=v[i+1];
    ne--;

}

int main()
{
    for (f>>n; n; --n)
    {
        f>>op>>x;
        if (op==1)
        {
            adauga(x);
            continue;
        }
        if (op==2)
        {
            sterge(x);
            continue;
        }
        g<<(cauta(x)!= -1)<<"\n";
    }
    return 0;
}