#include <bits/stdc++.h>
using namespace std;
const int M=200010;
int q,m,c[M],o[M][3],a[M],s;
void u(int i,int x){for(;i<=m;i+=i&-i)a[i]+=x;}
int qy(int i){int t=0;for(;i;i-=i&-i)t+=a[i];return t;}
int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    cin>>q;
    for(int i=0;i<q;++i){
        cin>>o[i][0]>>o[i][1]>>o[i][2];
        if(o[i][0])c[m++]=o[i][1],c[m++]=o[i][2];
        else c[m++]=o[i][1];
    }
    sort(c,c+m);
    m=unique(c,c+m)-c;
    for(int i=0;i<q;++i){
        if(o[i][0]){
            int l=lower_bound(c,c+m,o[i][1])-c;
            int r=upper_bound(c,c+m,o[i][2])-c-1;
            if(l<=r)s+=qy(r+1)-qy(l);
        }else{
            int p=lower_bound(c,c+m,o[i][1])-c;
            u(p+1,o[i][2]);
        }
    }
    cout<<s;
}