#include<bits/stdc++.h>

#define debug(x) cerr << #x << ": " << x << '\n'
#define debugArray(x,n) for(long long hoge = 0; (hoge) < (n); ++ (hoge)) cerr << #x << "[" << hoge << "]: " << x[hoge] << '\n'
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll,ll> Pll;
typedef vector<ll> vll;
const ll INF = LLONG_MAX/10;
const ll MOD = 1e9+7;

template <class T>
struct BIT {
    vector<T> dat;
    BIT(int n) : dat(n+1,0) { }
    // initialize by a constant
    BIT(int n, T a) : dat(n+1, a) {
        dat[0] = 0;
        for (int k = 1; k+(k&-k) <= n; ++k) dat[k+(k&-k)] += dat[k];
    }
    // initialize by a vector
    BIT(vector<T> y) : dat(y.size()+1) {
        for (int k = 0; k < y.size(); ++k) dat[k+1] = y[k];
        for (int k = 1; k+(k&-k) < dat.size(); ++k) dat[k+(k&-k)] += dat[k];
    }
    void add(int k, T a) {
        for (++k; k < (ll)dat.size(); k += k&-k) dat[k] += a;
    }
    T sum(int k) {
        T s = 0;
        for (; k > 0; k &= k-1) s += dat[k];
        return s;
    }
    int lower_bound(T a) {
        if (a <= 0) return 0;
        int k = dat.size()-1;
        for (int s: {1,2,4,8,16}) k |= (k >> s);
        for (int p = ++k; p > 0; p >>= 1, k |= p)
            if (k < dat.size() && dat[k] < a) a -= dat[k]; else k ^= p;
        return k+1;
    }
};

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll Q;cin>>Q;
  vll V;
  vector<tuple<ll,ll,ll> > query(Q);
  for(ll q=0;q<Q;q++){
    ll op,a,b;cin>>op>>a>>b;
    query[q]=make_tuple(op,a,b);
      V.push_back(a);
    if(op){
      V.push_back(b);
      V.push_back(b+1);
    }
  }
  sort(V.begin(),V.end());
  V.erase(unique(V.begin(),V.end()),V.end());
  ll N=V.size();
  map<ll,ll> id;
  for(ll i=0;i<N;i++){
    id[V[i]]=i;
  }
  BIT<ll> bit(N);
  ll ans = 0;
  for(ll q=0;q<Q;q++){
    ll op,a,b;
    tie(op,a,b)=query[q];
    if(op){
      ans += bit.sum(id[b+1])-bit.sum(id[a]);
    }else{
      bit.add(id[a],b);
    }
  }
  cout<<ans<<endl;
  return 0;
}