#include <fstream>
#include <unordered_set>

using namespace std;

int N, op, x;
unordered_set<int> hash;

int main()
{

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

  fin.sync_with_stdio(false);
  fin.tie(0);
  

  fin >> N;
  for (int i = 0; i < N; ++i) {
    fin >> op >> x;
    if (op == 1) {
      hash.insert(x);
      continue;
    }
    if (op == 2) {
      hash.erase(x);
      continue;
    }
    fout << (hash.find(x) != hash.end()) << "\n";
  }
  
  return 0;
}