#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

const int R = 666013;

vector<int> v[1000000];

int h(int x){
  return x / R;
}

int main()
{
    freopen("hashuri.in", "r", stdin);
    freopen("hashuri.out", "w", stdout);
    int n, i, a, b;
    scanf("%d", &n);
    for(i = 0;i < n;i++){
      scanf("%d%d", &a, &b);
      if(a == 1){
        v[h(b)].push_back(b);
      }
      else
      if(a == 2){
        if(find(v[h(b)].begin(), v[h(b)].end(), b) != v[h(b)].end())
          v[h(b)].erase(find(v[h(b)].begin(), v[h(b)].end(), b));
      }
      else
      if(a == 3){
        if(find(v[h(b)].begin(), v[h(b)].end(), b) != v[h(b)].end()){
          printf("1\n");
        }
        else{
          printf("0\n");
        }
      }
    }
    return 0;
}