#include <bits/stdc++.h>
const int maxn = 2e5 + 5;
using namespace std;
int rd() {
  int x = 0, f = 1;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) x = (x << 3) + (x << 1) + c - '0', c = getchar();
  return x * f;
}
int n, q, cnt, id, now;
map<long long, int> mp;
map<pair<int, int>, int> ans;
vector<pair<int, int> > a[maxn];
vector<pair<int, int> >::iterator it;
int gcd(int a, int b) { return (b == 0) ? a : gcd(b, a % b); }
int get(long long x) {
  if (!mp.count(x)) mp[x] = ++id;
  return mp[x];
}
pair<int, int> fac(int x, int y) {
  int z = gcd(x, y);
  return make_pair(x / z, y / z);
}
int main() {
  n = rd();
  for (int i = 1, op, x, y; i <= n; i++) {
    op = rd();
    x = rd();
    y = rd();
    long long r = 1ll * x * x + 1ll * y * y;
    if (op == 1) {
      ++cnt;
      now = get(r);
      for (int i = 0; i < ((int)a[now].size()); i++)
        ans[fac(a[now][i].first + x, a[now][i].second + y)] += 2;
      ans[fac(x, y)]++;
      a[now].push_back(make_pair(x, y));
    } else if (op == 2) {
      --cnt;
      now = get(r);
      for (int i = 0; i < ((int)a[now].size()); i++)
        if (a[now][i] != make_pair(x, y))
          ans[fac(a[now][i].first + x, a[now][i].second + y)] -= 2;
      ans[fac(x, y)]--;
      it = a[now].begin();
      while (*it != make_pair(x, y)) ++it;
      a[now].erase(it);
    } else
      printf("%d\n", cnt - ans[fac(x, y)]);
  }
  return 0;
}
