#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  ll sum = 0;
  vector<vector<int>> l(n), r(n);
  REP(i, n) {
    int c, x, y; cin >> c >> x >> y;
    if (x == y) {
      sum += x;
      continue;
    }
    if (c == 0) {
      sum += x;
      continue;
    }
    if (c == n) {
      sum += y;
      continue;
    }
    if (x > y) {
      r[c].emplace_back(x - y);
      sum += y;
    } else {
      l[c - 1].emplace_back(y - x);
      sum += x;
    }
  }
  priority_queue<int> que;
  vector<ll> ls, rs;
  for (int i = n - 1; i >= 0; --i) {
    for (const int v : l[i]) que.emplace(v);
    if (!que.empty()) {
      ls.emplace_back(que.top());
      que.pop();
    }
  }
  ranges::reverse(ls);
  ls.resize(n, 0);
  FOR(i, 1, n) ls[i] += ls[i - 1];
  while (!que.empty()) que.pop();
  REP(i, n) {
    for (const int v : r[i]) que.emplace(v);
    if (!que.empty()) {
      rs.emplace_back(que.top());
      que.pop();
    }
  }
  ranges::reverse(rs);
  rs.resize(n, 0);
  ranges::reverse(rs);
  for (int i = n - 2; i >= 0; --i) rs[i] += rs[i + 1];
  ll ans = max(rs.front(), ls.back());
  REP(i, n - 1) chmax(ans, ls[i] + rs[i + 1]);
  cout << sum + ans << '\n';
  return 0;
}