#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;

int main()
{
    int n;
    cin>>n;
    ll sum=0;
    vector<vector<pair<int,ll>>> v(2);
    for(int i=0;i<n;i++){
        int c,x,y;
        cin>>c>>x>>y;
        if(x>=y){
            v[0].push_back(make_pair(n-c,x-y));
            sum+=y;
        }else{
            v[1].push_back(make_pair(c,y-x));
            sum+=x;
        }
    }
    auto solve=[n](vector<pair<int,ll>> v)->ll{
        int m=v.size(); 
        sort(v.begin(),v.end());
        ll res=0;
        priority_queue<ll,vector<ll>,greater<ll>> pq;
        int l=0;
        for(int i=0;i<=n;i++){
            while(l<m&&v[l].first<=i){
                pq.push(v[l].second);
                l++;
            }
            while(pq.size()>i){
                pq.pop();
            }

        }
        while(!pq.empty()){
            res+=pq.top();
            pq.pop();
        }
        return res;



    };
    cout<<sum+solve(v[0])+solve(v[1])<<endl;
    return 0;
}