#include <iostream>
#include <fstream>
using namespace std;

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

const int NMAX = 1000000;
const int MOD = 667013;
int n;
int lungime=0;
int G[MOD];

int find(int x)
{
  int list = x % MOD;
  for(int i=0;i<lungime; i++)
    if(G[i] == x)
      return i;
  return -1;
}

void insert(int x)
{
  int list = x % MOD;
  if(find(x) == -1)
    G[lungime++] = x;
}

void erase(int x)
{
  int list = x%MOD;
  int i = find(x);
  for (;i<lungime;i++)
  {
    G[i] = G[i+1];
  }
  lungime--;
}

int main()
{
  int op, x;
  in>>n;
  while(n--)
  {
    in>>op>>x;
    if(op == 1)
    {
      insert(x);
      continue; /// ??
    }
    if(op == 2)
    {
      erase(x);
      continue;
    }
    if(op == 3)
    {
      out<<(find(x) != -1)<<"\n";
    }
  }







  return 0;
}