#include <fstream>
#include <list>
#include <unordered_set>

using namespace std;

const int NMAX = 1000005;
int N;

int main() {
   ifstream iff("hashuri.in");
   ofstream off("hashuri.out");

   iff >> N;

   unordered_set<int> s;

   for (int i = 0; i < N; ++i) {
      int t, val;
      iff >> t >> val;
      if (t == 1) {
         s.insert(val);
      } else if (t == 2) {
         if (s.find(val) != s.end()) {
            s.erase(val);
         }
      } else {
         if (s.find(val) == s.end()) {
            off << 0 << endl;
         } else {
            off << 1 << endl;
         }
      }
   }

   return 0;
}