#include <bits/stdc++.h>
using namespace std;
const int M=600010;
int q,m,t[M];
long long x[M],y[M],c[M],a[M],s;
void u(int i,long long v){for(;i<=m;i+=i&-i)a[i]+=v;}
long long qy(int i){long long r=0;for(;i;i-=i&-i)r+=a[i];return r;}
int main(){
    scanf("%d",&q);
    for(int i=0;i<q;++i){
        scanf("%d%lld%lld",&t[i],&x[i],&y[i]);
        if(t[i])c[m++]=x[i],c[m++]=y[i];
        else c[m++]=x[i];
    }
    sort(c,c+m);
    m=unique(c,c+m)-c;
    for(int i=0;i<q;++i){
        if(t[i]){
            int l=lower_bound(c,c+m,x[i])-c;
            int r=upper_bound(c,c+m,y[i])-c-1;
            if(l<=r)s+=qy(r+1)-qy(l);
        }else{
            int p=lower_bound(c,c+m,x[i])-c;
            u(p+1,y[i]);
        }
    }
    printf("%lld",s);
}