#include <bits/stdc++.h>
using namespace std;

int main() {
  ios::sync_with_stdio(false);

  int W;
  cin >> W;

  vector<int64_t> A(W);
  vector<int64_t> B(W);
  vector<int64_t> C(W);
  for (int i = 0; i < W; ++i) cin >> A[i] >> B[i] >> C[i];

  if (W == 1) {
    cout << 0 << endl;
    return 0;
  }

  function<void(int, int, int, int, int64_t, int64_t, map<int, vector<pair<int64_t, int64_t>>> &)>
      dfs = [&](int x, int f, int p, int g, int64_t love, int64_t money, map<int, vector<pair<int64_t, int64_t>>> &bag) {
    if (x == g) {
      bag[f << 2 | p].emplace_back(money, love);
      return;
    }
    if (f == -1) {
      dfs(x + 1, 0, 0, g, 0, 0, bag); // school
      dfs(x + 1, 1, 1, g, B[x], -C[x], bag); // date, check when combining
      dfs(x + 1, 2, 2, g, 0, A[x], bag); // work
    } else {
      if (p == 0) {
        dfs(x + 1, f, 1, g, love + B[x], money - C[x], bag);
      } else {
        dfs(x + 1, f, 0, g, love, money, bag);
        dfs(x + 1, f, 2, g, love, money + A[x], bag);
      }
    }
  };
  map<int, vector<pair<int64_t, int64_t>>> bag0;
  dfs(0, -1, -1, W / 2, 0, 0, bag0);
  map<int, vector<pair<int64_t, int64_t>>> bag1;
  dfs(W / 2, -1, -1, W, 0, 0, bag1);

  int64_t ans = 0; {
    vector<pair<int64_t, int64_t>> g1; {
      for (int i = 0; i < 3; ++i) if (i != 1) g1.insert(g1.end(), bag0[i << 2 | 0].begin(), bag0[i << 2 | 0].end());
      sort(g1.begin(), g1.end());
    }
    vector<pair<int64_t, int64_t>> d0; {
      for (int i = 0; i < 3; ++i) d0.insert(d0.end(), bag1[1 << 2 | i].begin(), bag1[1 << 2 | i].end());
    }
    vector<int64_t> pmaxloveg(g1.size());
    pmaxloveg.back() = g1.back().second;
    for (int i = g1.size() - 2; ~i; --i) {
      pmaxloveg[i] = max(pmaxloveg[i + 1], g1[i].second);
    }
    for (auto ml : d0) {
      int64_t money, love;
      tie(money, love) = ml;
      int x = lower_bound(g1.begin(), g1.end(), make_pair(-money, (int64_t) 0)) - g1.begin();
      if (x < g1.size()) ans = max(ans, love + pmaxloveg[x]);
    }
  } {
    vector<pair<int64_t, int64_t>> g1; {
      for (int i = 0; i < 3; ++i) if (i != 1) g1.insert(g1.end(), bag0[i << 2 | 1].begin(), bag0[i << 2 | 1].end());
      for (int i = 0; i < 3; ++i) if (i != 1) g1.insert(g1.end(), bag0[i << 2 | 2].begin(), bag0[i << 2 | 2].end());
      sort(g1.begin(), g1.end());
    }
    vector<pair<int64_t, int64_t>> d0; {
      for (int i = 0; i < 3; ++i) d0.insert(d0.end(), bag1[0 << 2 | i].begin(), bag1[0 << 2 | i].end());
      for (int i = 0; i < 3; ++i) d0.insert(d0.end(), bag1[2 << 2 | i].begin(), bag1[2 << 2 | i].end());
    }
    vector<int64_t> pmaxloveg(g1.size());
    pmaxloveg.back() = g1.back().second;
    for (int i = g1.size() - 2; ~i; --i) {
      pmaxloveg[i] = max(pmaxloveg[i + 1], g1[i].second);
    }
    for (auto ml : d0) {
      int64_t money, love;
      tie(money, love) = ml;
      int x = lower_bound(g1.begin(), g1.end(), make_pair(-money, (int64_t) 0)) - g1.begin();
      if (x < g1.size()) ans = max(ans, love + pmaxloveg[x]);
    }
  }

  cout << ans << endl;

  return 0;
}