#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const long long INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<vector<long long>>vx(n + 1);
	vector<vector<long long>>vy(n + 1);
	long long ans = 0;
	rep(i, n) {
		int c, x, y; cin >> c >> x >> y;
		ans += min(x, y);
		if (x >= y) {
			vx[c].push_back(x - y);
		}
		else {
			vy[n - c].push_back(y - x);
		}
	}
	auto f = [&](vector<vector<long long>> v)->long long {
		long long ret = 0;
		priority_queue<long long>pq;
		rep(i, n) {
			for (auto e : v[i])pq.push(e);
			if (pq.empty())continue;
			auto top = pq.top();
			ret += top;
			pq.pop();
		}
		return ret;
	};
	ans += f(vx);
	ans += f(vy);
	cout << ans << endl;
	return 0;
}