#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;
	int st = n;
	int ed = st + 1;
	mcf_graph<int, long long>g(ed + 1);
	rep(i, n - 1)g.add_edge(i, i + 1, n, 0);
	rep(i, n) g.add_edge(st, i, 1, 0);
	long long tmp = 0;
	rep(i, n) {
		int c, x, y; cin >> c >> x >> y;
		if (0 == c) {
			tmp += x;
			continue;
		}
		if (n == c) {
			tmp += y;
			continue;
		}
		tmp += x;
		int z = y - x;
		g.add_edge(c - 1, ed, 1, INF * 2 - z);
		g.add_edge(n - 1, ed, 1, INF * 2);
	}
	auto f = g.flow(st, ed);
	long long ans = INF * 2 * f.first - f.second;
	ans += tmp;
	cout << ans << endl;
	return 0;
}