#include <fstream>
#include <vector>

using namespace std;

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

const int MOD = 1e6 + 3;

vector < int > :: iterator find_val(int x, vector < vector < int > > &l) {

  int no = x % MOD;
  vector < int > :: iterator it;
  for (it = l[no].begin(); it != l[no].end(); it ++) {
    if (*it == x) {
      return it;
    }
  }

  return l[no].end();
}

void add(int x, vector < vector < int > > &l) {

  int no = x % MOD;
  if (find_val(x, l) == l[no].end()) {
    l[no].push_back(x);
  }
}

void del(int x, vector < vector < int > > &l) {
  
  int no = x % MOD;
  if (not (find_val(x, l) == l[no].end())) {
    l[no].erase(find_val(x, l));
  }
}

void is_in(int x, vector < vector < int > > &l) {
  
  int no = x % MOD;
  cout << not (find_val(x, l) == l[no].end()) << '\n';
}

int main() {

  int n;
  cin >> n;
  vector < vector < int > > l(MOD);

  for (int i = 1; i <= n; i ++) {

    int op, x;
    cin >> op >> x;
    if (op == 1) {
      add(x, l);
    }
    else if (op == 2) {
     del(x, l);
    }
    else {
      is_in(x, l);
    }
  }
}