#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
//const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int W;
  cin >> W;
  // アルバイト
  // 学校->デート
  // ΣA[i]-ΣC[j]≧0
  // maximize ΣB[j]

  vector< int64 > A(W), B(W), C(W);
  for(int i = 0; i < W; i++) {
    cin >> A[i] >> B[i] >> C[i];
  }

  int M = W / 2; // [0,M) [M,W)

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

  // last = 0: アルバイト
  // last = 1: 学校
  // last = 2: デート

  vector< pair< int64, int64 > > prefix[3];

  MFP([&](auto gen, int l, int last, int64 aSum, int64 bSum) -> void {
    if(l == M) {
      prefix[last].emplace_back(aSum, bSum);
      return;
    }
    if(last == 0) {
      gen(l + 1, 2, aSum - C[l], bSum + B[l]);
    } else {
      gen(l + 1, 0, aSum, bSum);
      gen(l + 1, 1, aSum + A[l], bSum);
    }
  })(0, -1, 0, 0);


  vector< pair< int64, int64 > > suffix[3];

  auto gen = MFP([&](auto gen, int l, int first, int last, int64 aSum, int64 bSum) -> void {
    if(l == W) {
      suffix[first].emplace_back(aSum, bSum);
      return;
    }
    if(last == 0) {
      gen(l + 1, M == l ? 2 : first, 2, aSum - C[l], bSum + B[l]);
    } else {
      gen(l + 1, M == l ? 0 : first, 0, aSum, bSum);
      gen(l + 1, M == l ? 1 : first, 1, aSum + A[l], bSum);
    }
  });
  gen(M, -1, -1, 0, 0);
  gen(M, -1, 0, 0, 0);


  int64 ret = 0;

  auto solve = [&](vector< pair< int64, int64 > > &a, vector< pair< int64, int64 > > &b) {
    //a.first+b.first>=0のもの
    for(auto &p : a) {
      int pos = lower_bound(begin(b), end(b), make_pair(-p.first, -infll)) - begin(b);
      if(pos < b.size()) chmax(ret, p.second + b[pos].second);
    }
  };
  for(int i = 0; i < 3; i++) {
    sort(begin(suffix[i]), end(suffix[i]));
    int64 latte = -infll;
    for(int j = (int) suffix[i].size() - 1; j >= 0; j--) {
      chmax(latte, suffix[i][j].second);
      suffix[i][j].second = latte;
    }
  }


  solve(prefix[0], suffix[2]);
  solve(prefix[1], suffix[0]);
  solve(prefix[1], suffix[1]);
  solve(prefix[2], suffix[0]);
  solve(prefix[2], suffix[1]);
  cout << ret << endl;
}