#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:268435456")
using namespace std;
template <typename T>
inline T abs(T a) {
  return ((a < 0) ? -a : a);
}
template <typename T>
inline T sqr(T a) {
  return a * a;
}
template <class T>
T gcd(T a, T b) {
  return a ? gcd(b % a, a) : b;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
T sign(T a) {
  return a > 0 ? 1 : (a < 0 ? -1 : 0);
}
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const int dxK[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int dyK[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dxKn[] = {-2, -1, 1, 2, 2, 1, -1, -2};
const int dyKn[] = {1, 2, 2, 1, -1, -2, -2, -1};
const int N = int(1e6) + 9;
const int M = int(1.5e2) + 9;
const int LOGN = 22;
const int SQN = 350;
const int MOD = int(1e9) + 7;
const int INF = 1e9 + 100;
const long long INF64 = 2e18;
const long double PI = 3.1415926535897932384626433832795;
const long double EPS = 1e-9;
int n;
int type[N], t[N], d[N];
vector<int> v;
map<int, int> f[N];
void add(int pos, int d) {
  for (; pos < N; pos |= pos + 1) ++f[pos][d];
}
void sub(int pos, int d) {
  for (; pos < N; pos |= pos + 1) --f[pos][d];
}
int get(int pos, int d) {
  int res = 0;
  for (; pos >= 0; pos = (pos & (pos + 1)) - 1) res += f[pos][d];
  return res;
}
void solve() {
  scanf("%d", &n);
  v.resize(n);
  for (int i = 0; i < (int)(n); ++i) {
    scanf("%d %d %d", &type[i], &t[i], &d[i]);
    v[i] = t[i];
  }
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
  for (int i = 0; i < (int)(n); ++i)
    t[i] = lower_bound(v.begin(), v.end(), t[i]) - v.begin();
  for (int i = 0; i < (int)(n); ++i) {
    if (type[i] == 1) {
      add(t[i], d[i]);
    }
    if (type[i] == 2) {
      sub(t[i], d[i]);
    }
    if (type[i] == 3) {
      printf("%d\n", get(t[i], d[i]));
    }
  }
}
int main() {
  srand(time(NULL));
  srand(time(NULL));
  cout << setprecision(10) << fixed;
  cerr << setprecision(10) << fixed;
  solve();
  return 0;
}
