import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


alias Entry = Tuple!(int, "cond", long, "gain");

long solve(Entry[] E) {
  const N = cast(int)(E.length);
  auto gss = new long[][N + 1];
  foreach (e; E) {
    gss[min(e.cond, N)] ~= e.gain;
  }
  BinaryHeap!(Array!long, "a > b") que;
  foreach (k; 1 .. N + 1) {
    foreach (g; gss[k]) que.insert(g);
    for (; cast(int)(que.length) > k; que.removeFront) {}
  }
  long ans;
  for (; que.length; que.removeFront) ans += que.front;
  debug writeln(E, ": ", ans);
  return ans;
}

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto C = new int[N];
      auto X = new long[N];
      auto Y = new long[N];
      foreach (i; 0 .. N) {
        C[i] = readInt;
        X[i] = readInt;
        Y[i] = readInt;
      }
      
      long ans;
      Entry[] mae, ato;
      foreach (i; 0 .. N) {
        if (X[i] > Y[i]) {
          ans += Y[i];
          ato ~= Entry(N - C[i], X[i] - Y[i]);
        } else {
          ans += X[i];
          mae ~= Entry(C[i], Y[i] - X[i]);
        }
      }
      ans += solve(mae);
      ans += solve(ato);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}