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)); }


enum K = 3;

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto A = new int[][](N, K);
      foreach (i; 0 .. N) foreach (k; 0 .. 3) {
        A[i][k] = readInt;
      }
      
      auto dp = new long[][][](N + 1, 3, N + 1);
      foreach (i; 0 .. N + 1) foreach (k; 0 .. 3) dp[i][k][] = -1;
      foreach (k; 0 .. 3) dp[0][k][0] = 0;
      foreach (i; 0 .. N) {
        foreach (k; 0 .. 3) foreach (x; 0 .. N - i + 1) if (dp[i][k][x] >= 0) {
          foreach (kk; 0 .. 3) if (k != kk) {
            long t = dp[i][k][x];
            int xx = x + A[i][kk];
            if (xx > N - i) {
              t += cast(long)(N - i) * (xx - (N - i));
              xx = N - i;
            }
            t += xx;
            xx = max(xx - 1, 0);
            chmax(dp[i + 1][kk][xx], t);
          }
        }
      }
      long ans = -1;
      foreach (k; 0 .. 3) chmax(ans, dp[N][k][0]);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}