#include <stdio.h>
#include <vector>
using namespace std;

#define MAX_N 100
#define MOD 666013

int v[MAX_N];
vector<int> myHash[MOD];

bool cauta(int x) {
  int cod = x % MOD;
  unsigned int i = 0;
  while (i < myHash[cod].size() && myHash[cod][i] != x)
    ++i;
  return i < myHash[cod].size();
}

void adauga(int x) {
  int cod = x % MOD;
  unsigned int i = 0;
  while (i < myHash[cod].size() && myHash[cod][i] != x)
    ++i;
  if (i == myHash[cod].size())
    myHash[cod].push_back(x);
}

void sterge(int x) {
  int cod = x % MOD;
  unsigned int i = 0;
  while (i < myHash[cod].size() && myHash[cod][i] != x)
    ++i;
  if (i < myHash[cod].size())
    myHash[cod].erase(myHash[cod].begin() + i);
}

int main() {
  FILE *fin, *fout;
  fin = fopen( "divprim.in", "r" );
  fout = fopen( "divprim.out", "w" );
  int c, a, n, i;
  fscanf( fin, "%d", &n );
  for( i = 0; i < n; i++ ) {
    fscanf( fin, "%d", &c );
    fscanf( fin, "%d", &a );
    if( c == 1 )
      adauga( a );
    else if( c == 2 )
      sterge( a );
    else if( c == 3 && cauta( a ) )
      fprintf( fout, "1\n" );
    else
      fprintf( fout, "0\n" );
  }
  return 0;
}