#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() {
  constexpr int K = 3;
  int n; cin >> n;
  vector<array<int, K>> a(n);
  for (auto& a_i : a) for (int& a_ij : a_i) cin >> a_ij;
  vector dp(K, vector(n, -LINF));
  REP(j, K) {
    if (a.front()[j] >= n) {
      dp[j][min(a.front()[j] - 1, n - 1)] = a.front()[j] + (a.front()[j] - n) * (n - 1LL);
    } else {
      dp[j][max(a.front()[j] - 1, 0)] = a.front()[j];
    }
  }
  FOR(i, 1, n) {
    vector nxt(K, vector(n + 1, -LINF));
    REP(x, K) REP(j, n) REP(y, K) {
      if (y == x) continue;
      const int attack = j + a[i][y];
      if (attack >= n) {
        chmax(nxt[y][min(attack - 1, n - 1)], dp[x][j] + attack + (attack - n) * (n - 1LL - i));
      } else {
        chmax(nxt[y][max(attack - 1, 0)], dp[x][j] + attack);
      }
    }
    dp.swap(nxt);
  }
  ll ans = 0;
  for (const auto& dp_i : dp) chmax(ans, ranges::max(dp_i));
  cout << ans << '\n';
  return 0;
}