#include <stdio.h>
#include <unordered_map>

using namespace std;

const int NMAX = 1000005;
int N;

int app = 0;

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

   scanf("%d", &N);

   unordered_map<int, int> m;

   for (int i = 0; i < N; ++i) {
      int t, val;
      scanf("%d %d", &t, &val);

      if (t == 1) {
         if (m.find(val) == m.end()) {
            m[val] = ++app;
         }
      } else if (t == 2) {
         m.erase(val);
      } else {
         if (m.find(val) == m.end()) {
            printf("0\n");
         } else {
            printf("1\n");
         }
      }
   }

   return 0;
}