#include <iostream>
#include <cstdlib>
#include <unordered_set>
using namespace std;

struct hash_struct {
  unordered_set<int> values;
} my_hash[3003];


int get_hash (int val) {
  return val % 3003;
}

void insert (int val) {
my_hash[get_hash (val)].values.insert (val);
}

int find (int val) {
return my_hash[get_hash (val)].values.find (val) != my_hash[get_hash(val)].values.end();
}

void delete_h (int val) {
my_hash[get_hash (val)].values.erase (val);
}

int main() {

freopen ("hashuri.in", "r", stdin);
freopen ("hashuri.out", "w", stdout);

int n; cin >> n;
for (int i = 0; i < n; ++i) {
int t; cin >> t;
int x; cin >> x;

if (t == 1) {
insert (x);
} else if (t == 2) {
delete_h (x);
} else {
cout << find(x) << "\n";
}
}


  
  return 0;
}