#include <algorithm>
#include <cstdint>
#include <cstdio>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
using i64 = int64_t;

template <class T>
map<T, int> compress(const vector<T> &v) {
  size_t n = v.size();
  vector<T> mp = v;
  sort(mp.begin(), mp.end()); mp.erase(unique(mp.begin(), mp.end()), mp.end());
  map<T, int> w;
  for(size_t i=0; i<n; ++i) {
    w[v[i]] = static_cast<int>(distance(mp.begin(), lower_bound(mp.begin(), mp.end(), v[i])));
  }
  return w;
}

template <class T>
class BIT {
  int N;
  vector<T> dat;
 public:
  explicit BIT(int n) : N(n+2), dat(N) {}
  void add(int k, T x) {
    for(int i=k+1; i<N; i+=i&-i) { dat[i] += x; }
  }
  T sum(int k) {
    T res = 0;
    for(int i=k; i; i-=i&-i) { res += dat[i]; }
    return res;
  }
};

int main(void) {
  size_t Q; scanf("%lu", &Q);
  vector<tuple<int, int, int>> logs;
  vector<int> v;
  for(size_t q=0; q<Q; ++q) {
    int a, b, c; scanf("%d%d%d", &a, &b, &c);
    switch(a) {
      case 0:
        logs.emplace_back(a, b, c);
        v.push_back(b);
        break;
      case 1:
        logs.emplace_back(a, b, c+1);
        v.push_back(b);
        v.push_back(c+1);
        break;
    }
  }
  map<int, int> w = compress(v);
  BIT<i64> tree(static_cast<int>(w.size()));
  i64 res = 0;
  for(size_t i=0; i<Q; ++i) {
    auto[a, b, c] = logs[i];
    switch(a) {
      case 0:
        tree.add(w[b], c);
        break;
      case 1:
        res += tree.sum(w[c]) - tree.sum(w[b]);
        break;
    }
  }
  printf("%ld\n", res);
  return 0;
}