import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)

N=int(input())
CXY0=[]
CXY1=[]
ans=0
for i in range(N):
    c,x,y=map(int,input().split())
    if x<y:
        CXY0.append((c,x,y))
    elif x>y:
        CXY1.append((c,x,y))
    else:
        ans+=c
def solve(CXY):
    retu=0
    query=[[] for c in range(N+1)]
    for c,x,y in CXY:
        query[c].append((x,y))
        retu+=x
    queue=[]
    for c in range(N,-1,-1):
        if queue:
            retu+=_heappop_max(queue)
        for x,y in query[c]:
            _heappush_max(queue,y-x)
    return retu
ans=solve(CXY0)+solve([(N-c,y,x) for c,x,y in CXY1])
print(ans)