#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:210886422")
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000007;
const double EPS = 1e-11;
const int HASH_POW = 29;
const long double PI = acos(-1.0);
mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
long long nextLong(long long l, long long r) {
  uniform_int_distribution<long long> foo(l, r);
  return foo(rnd);
}
double nextDouble(double l, double r) {
  uniform_real_distribution<double> foo(l, r);
  return foo(rnd);
}
double workTime() { return double(clock()) / CLOCKS_PER_SEC; }
void myReturn(int code = 0) { exit(code); }
int gcd(int a, int b) {
  if (!b) {
    return a;
  }
  return gcd(b, a % b);
}
struct myHash {
  size_t operator()(const pair<int, int> &x) const {
    return (x.first ^ (x.second << 10));
  }
};
int n = 0;
unordered_map<long long, unordered_set<pair<int, int>, myHash> > pts;
unordered_map<pair<int, int>, int, myHash> cntDirPts, cntDirAxis;
void insertDirection(pair<int, int> pt,
                     unordered_map<pair<int, int>, int, myHash> &store) {
  int g = gcd(pt.first, pt.second);
  pt.first /= g;
  pt.second /= g;
  ++store[pt];
}
void removeDirection(pair<int, int> pt,
                     unordered_map<pair<int, int>, int, myHash> &store) {
  int g = gcd(pt.first, pt.second);
  pt.first /= g;
  pt.second /= g;
  --store[pt];
}
int countDirections(pair<int, int> pt,
                    unordered_map<pair<int, int>, int, myHash> &store) {
  int g = gcd(pt.first, pt.second);
  pt.first /= g;
  pt.second /= g;
  return store[pt];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int q;
  scanf("%d", &q);
  while (q-- > 0) {
    int t, x, y;
    scanf("%d %d %d", &t, &x, &y);
    if (t == 1) {
      ++n;
      long long dist = x * 1ll * x + y * 1ll * y;
      for (auto it : pts[dist]) {
        int foo = x + it.first, bar = y + it.second;
        insertDirection({foo, bar}, cntDirAxis);
      }
      pts[dist].insert({x, y});
      insertDirection({x, y}, cntDirPts);
    } else if (t == 2) {
      --n;
      long long dist = x * 1ll * x + y * 1ll * y;
      removeDirection({x, y}, cntDirPts);
      pts[dist].erase({x, y});
      for (auto it : pts[dist]) {
        int foo = x + it.first, bar = y + it.second;
        removeDirection({foo, bar}, cntDirAxis);
      }
    } else {
      int symm = countDirections({x, y}, cntDirPts) +
                 2 * countDirections({x, y}, cntDirAxis);
      printf("%d\n", n - symm);
    }
  }
  myReturn();
}
