#include #define rep(i, n) for (int i = 0; i < int(n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define reps(i, n) for (int i = 1; i <= int(n); i++) #define rreps(i, n) for (int i = int(n); i >= 1; i--) #define repc(i, n) for (int i = 0; i <= int(n); i++) #define rrepc(i, n) for (int i = int(n); i >= 0; i--) #define repi(i, a, b) for (int i = int(a); i < int(b); i++) #define repic(i, a, b) for (int i = int(a); i <= int(b); i++) #define all(a) (a).begin(), (a).end() #define bit32(x) (1 << (x)) #define bit64(x) (1ll << (x)) #define sz(v) ((int) v.size()) using namespace std; using i64 = long long; using f80 = long double; using vi32 = vector; using vi64 = vector; using vf80 = vector; using vstr = vector; inline void yes() { cout << "Yes" << endl; exit(0); } inline void no() { cout << "No" << endl; exit(0); } inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); } inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; } template class pqasc : public priority_queue, greater> {}; template class pqdesc : public priority_queue, less> {}; template inline void amax(T &x, T y) { x = max(x, y); } template inline void amin(T &x, T y) { x = min(x, y); } template inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } template istream& operator>>(istream &is, vector &v) { for (auto &x : v) is >> x; return is; } template ostream& operator<<(ostream &os, vector &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; } void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; } template struct FenwickTree { vector v; int n; FenwickTree(int n) : n(n) { v = vector(n); } void update(int i, T x) { for (i++; i <= n; i += i & -i) v[i - 1] += x; } T query(int i) { T r = 0; for (; i >= 1; i -= i & -i) r += v[i - 1]; return r; } }; void solve() { int n; cin >> n; vi32 q(n), x(n), y(n); rep(i, n) { cin >> q[i] >> x[i] >> y[i]; } set se; rep(i, n) if (q[i] == 1) { se.insert(x[i]); se.insert(y[i]); } else { se.insert(x[i]); } vi32 o; for (auto s : se) o.push_back(s); int m = sz(o); FenwickTree ft(m); int ans = 0; rep(i, n) { if (q[i] == 0) { if (o[0] > x[i]) continue; if (o[m - 1] < x[i]) continue; int d = lower_bound(all(o), x[i]) - o.begin(); if (o[d] != x[i]) { d += 1; } ft.update(d, y[i]); } else { int l = lower_bound(all(o), x[i]) - o.begin(); int r = lower_bound(all(o), y[i]) - o.begin() + 1; int sum = ft.query(r) - ft.query(l); ans += sum; } } cout << ans << endl; }