#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;

template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
  out << "{" << p.first << ", " << p.second << "}";
  return out;
}

template <typename T>
ostream &operator<<(ostream &out, const vector<T> &v) {
  out << '{';
  for (const T &item : v) out << item << ", ";
  out << "\b\b}";
  return out;
}
#endif

#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 200010

template <typename T>
struct DynamicRangeAddSegtree{
  struct Node{
    T val, add;
    Node *l, *r;

    Node():val(0), add(0), l(NULL), r(NULL){}
    ~Node() {
      if (l) delete l;
      if (r) delete r;
    }
  };

  Node *root;
  ll segn2;

  DynamicRangeAddSegtree(ll n){
    for(segn2=1; segn2<n; segn2*=2);
    root = new Node();
  }

  virtual ~DynamicRangeAddSegtree() {
    delete root;
  }

  virtual T merge(T a, T b) = 0;
  virtual T rangeAdd(ll a, ll b, ll l, ll r, T add) = 0;

  void add(ll a, ll b, T c) {
    add(a, b, c, 0, segn2, root);
  }

  T query(ll a, ll b) {
    return query(a, b, 0, segn2, root);
  }

private:
  T add(ll a, ll b, T c, ll l, ll r, Node *node){
    if(!(r <= a || b <= l)) {
      if(a <= l && r <= b){
        node->add += c;
      } else {
        if(node->l == NULL) node->l = new Node();
        if(node->r == NULL) node->r = new Node();

        T lVal = add(a, b, c, l, (l+r)/2, node->l);
        T rVal = add(a, b, c, (l+r)/2, r, node->r);

        node->val = merge(lVal, rVal);
      }
    }

    return node->val + rangeAdd(l, r, l, r, node->add);
  }

  T query(ll a, ll b, ll l, ll r, Node *node){
    if(r <= a || b <= l) return 0;

    if(a <= l && r <= b){
      return node->val + rangeAdd(a, b, l, r, node->add);
    }

    T res = 0;

    if (node->l) res = merge(res, query(a, b, l, (l+r)/2, node->l));
    if (node->r) res = merge(res, query(a, b, (l+r)/2, r, node->r));

    return res + rangeAdd(a, b, l, r, node->add);
  }
};

template <typename T>
struct DynamicRangeAddRangeSumSegtree : public DynamicRangeAddSegtree<T> {
  DynamicRangeAddRangeSumSegtree(ll n) : DynamicRangeAddSegtree<T>(n) {}

  T merge(T a, T b) {
    return a + b;
  }

  T rangeAdd(ll a, ll b, ll l, ll r, T add) {
    return max(0LL, min(r, b) - max(a, l)) * add;
  }
};

template <typename T>
struct DynamicRangeAddRangeMinSegtree : public DynamicRangeAddSegtree<T> {
  DynamicRangeAddRangeMinSegtree(ll n) : DynamicRangeAddSegtree<T>(n) {}

  T merge(T a, T b) {
    return min(a, b);
  }

  T rangeAdd(ll a, ll b, ll l, ll r, T add) {
    return add;
  }
};

int main(){
  int N = 0;

  scanf("%d", &N);

  DynamicRangeAddRangeSumSegtree<ll> seg((int)1e9 + 1);

  ll ans = 0;

  while(N--) {
    int c, a, b;

    scanf("%d%d%d", &c, &a, &b);

    if (c == 0)
      seg.add(a, a+1, b);
    else
      ans += seg.query(a, b+1);
  }

  printf("%lld\n", ans);

  return 0;
}