from bisect import bisect_left
n=int(input())
l=[]
X=[]
for i in range(n):
    a,x,y=map(int,input().split())
    l.append((a,x,y))
    if a:
        X.append(x)
        X.append(y)
    else:
        X.append(x)
X.sort()
No=2**18
tree=[0]*(2*No)
def add(k,x):
    k+=No-1
    while k>=0:
        tree[k]+=x
        k=(k-1)//2
def sum(l):
    if l<0:
        return 0
    L=l+No-1
    s=0
    while L>0:
        if L&1:
            s+=tree[L]
            L=(L-2)//2
        else:
            L=(L-1)//2
    return s
ans=0
for i in l:
    a,x,y=i
    if a:
        x=bisect_left(X,x)-1
        y=bisect_left(X,y)
        ans+=sum(y)-sum(x)
    else:
        x=bisect_left(X,x)
        add(x,y)
print(ans)